Sample

int-18c923308bc4-SRC

Unmodified source class

Lines45

Scores

MethodScoreScale
Posnett00–1; higher is more readable
Scalabrino0.9460–1; higher is more readable
Dorn0.5590–1; higher is more readable
Mi0.2750–1; higher is more readable
LLOC2Logical lines; fewer is more readable
DeepSeek V4 Pro170–20; mean of three runs
GPT-6.1 Sol180–20; mean of three runs
BTTF0.6850–1; higher is more readable

Views

Source code

package io.netty.handler.ssl; import io.netty.internal.tcnative.SSLPrivateKeyMethod; import io.netty.util.internal.UnstableApi; import javax.net.ssl.SSLEngine; /** * Allow to customize private key signing / decrypting (when using RSA). Only supported when using BoringSSL atm. */ @UnstableApi public interface OpenSslPrivateKeyMethod { int SSL_SIGN_RSA_PKCS1_SHA1 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PKCS1_SHA1; int SSL_SIGN_RSA_PKCS1_SHA256 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PKCS1_SHA256; int SSL_SIGN_RSA_PKCS1_SHA384 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PKCS1_SHA384; int SSL_SIGN_RSA_PKCS1_SHA512 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PKCS1_SHA512; int SSL_SIGN_ECDSA_SHA1 = SSLPrivateKeyMethod.SSL_SIGN_ECDSA_SHA1; int SSL_SIGN_ECDSA_SECP256R1_SHA256 = SSLPrivateKeyMethod.SSL_SIGN_ECDSA_SECP256R1_SHA256; int SSL_SIGN_ECDSA_SECP384R1_SHA384 = SSLPrivateKeyMethod.SSL_SIGN_ECDSA_SECP384R1_SHA384; int SSL_SIGN_ECDSA_SECP521R1_SHA512 = SSLPrivateKeyMethod.SSL_SIGN_ECDSA_SECP521R1_SHA512; int SSL_SIGN_RSA_PSS_RSAE_SHA256 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PSS_RSAE_SHA256; int SSL_SIGN_RSA_PSS_RSAE_SHA384 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PSS_RSAE_SHA384; int SSL_SIGN_RSA_PSS_RSAE_SHA512 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PSS_RSAE_SHA512; int SSL_SIGN_ED25519 = SSLPrivateKeyMethod.SSL_SIGN_ED25519; int SSL_SIGN_RSA_PKCS1_MD5_SHA1 = SSLPrivateKeyMethod.SSL_SIGN_RSA_PKCS1_MD5_SHA1; /** * Signs the input with the given key and returns the signed bytes. * * @param engine the {@link SSLEngine} * @param signatureAlgorithm the algorithm to use for signing * @param input the digest itself * @return the signed data (must not be {@code null}) * @throws Exception thrown if an error is encountered during the signing */ byte[] sign(SSLEngine engine, int signatureAlgorithm, byte[] input) throws Exception; /** * Decrypts the input with the given key and returns the decrypted bytes. * * @param engine the {@link SSLEngine} * @param input the input which should be decrypted * @return the decrypted data (must not be {@code null}) * @throws Exception thrown if an error is encountered during the decrypting */ byte[] decrypt(SSLEngine engine, byte[] input) throws Exception; }

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.965.73−31.869
Source linesThe number of non-empty source lines.45+18
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.991−7.487

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

Score0.946

Feature contributions

FeatureValueContribution
(log-odds)
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.112.978−1.12
Comment layout (horizontal)How rapidly the visual pattern of comment characters changes from left to right.112.913+1.017
Operator visual areaThe share of the code’s visual area occupied by operators such as +, =, and *.0.032+0.633
Comment layout frequencyHow frequently the layout switches between lines containing only comments or whitespace and lines containing code.46−0.592
Indentation frequencyHow rapidly indentation changes from line to line.28+0.231
Number layout frequencyHow rapidly the number of numeric values per line changes through the code.28−0.222
Identifier layout (vertical)How rapidly the visual pattern of identifier characters changes from top to bottom.44.93+0.218

Intercept 0.07 + feature contributions = 0.236 (log-odds).
Score = sigmoid(0.236) = 0.559.

Score0.275
Score2
Run 1

The code is well-structured, clearly an interface definition with purpose. It uses flat structure with no nesting beyond the interface. Constants are logically grouped and mapped directly from the underlying library. Javadoc explains intent and parameters for both methods. Each constant declaration is on one line, aiding readability. The import section is minimal. Minor deductions for the long lines of constant names, but they follow naming conventions and are inherently verbose. The readability is high.

Run 2

The code is highly readable. It has a clean, logical structure with a clear interface definition, flat nesting, and concise purpose. The constant declarations follow a consistent pattern and are grouped logically, though the long repeated prefixes slightly reduce visual scanning efficiency. The Javadoc comments clearly explain method intent, parameters, return values, and exceptions. Each line represents a single action, and the reading flow is natural—constants first, then method signatures. Minor deductions: the interface-level comment could be more descriptive, and the constant block is verbose, but these do not significantly hinder readability.

Run 3

The code is generally well-structured and clear. It defines an interface with a set of integer constants and two abstract methods. The purpose is straightforward: to allow customization of private key operations in OpenSSL. The constants are logically grouped and named descriptively, and the methods have clear Javadoc with parameter and return descriptions. The file is flat, not deeply nested, and each constant/method is on one line, though the constant declarations are slightly long. Reading flow is natural: constants first, then methods. Minor deductions are for the somewhat repetitive constant list and the terse top-level comment, but overall the code is highly readable for a Java interface definition.

Run 1

Code Structure: Logically organized into imports, interface documentation, algorithm constants, and method declarations. Nesting: Flat interface with no nested control flow. Clarity of intent: Descriptive names and parameter/return documentation clearly communicate signing and decryption responsibilities, though references to a 'given key' leave key selection implicit. Code length: Concise for the exposed API; repeated constant aliases are appropriate but visually dense. Action granularity: Each constant and method declaration occupies its own line. Reading flow: Natural top-to-bottom progression, slightly weakened by missing spacing around imports and limited visual grouping of algorithm families. Minor documentation issues, including informal 'atm' and awkward phrasing, prevent a perfect score.

Run 2

Code Structure: Clearly organized interface with imports, algorithm constants, and two documented method declarations. Nesting: Flat, with no nested control flow. Clarity of intent: Descriptive names and Javadoc make signing and decryption responsibilities clear, though the introductory RSA wording is slightly ambiguous given the non-RSA signing constants. Code length: Concise for its purpose; repeated constant aliases add visual bulk but are appropriate API declarations. Action granularity: Each constant and method declaration occupies its own line, making individual elements easy to identify. Reading flow: Natural progression from configuration identifiers to operations, with consistent formatting. Blank lines between import groups and related algorithm families would further improve scanning.

Run 3

Code Structure: Logically organized into imports, algorithm constants, and two documented method declarations. Nesting: Flat interface with no nested control flow. Clarity of intent: Descriptive names and parameter/return documentation make signing and decryption responsibilities clear, though the introductory RSA wording is ambiguous and 'atm' is informal. Code length: Concise for its API surface; repetitive constant aliases are justified. Action granularity: Each constant and method declaration occupies its own line. Reading flow: Natural progression from supported algorithms to operations, with minor improvements possible through import spacing and grouping constants by algorithm family.