public static void spreadIntsToBytes(final int[] inInts, final int inOff, final byte[] outBytes, final int outOff, final int intLen) {

        for (int i = 0; i < intLen; ++i) {

            outBytes[outOff + i * 4] = (byte) (inInts[inOff + i] >>> 24);
            outBytes[outOff + i * 4 + 1] = (byte) (inInts[inOff + i] >>> 16);
            outBytes[outOff + i * 4 + 2] = (byte) (inInts[inOff + i] >>> 8);

 * href="https://github.com/google/guava/wiki/PrimitivesExplained">primitive utilities</a>.
 *
 * @author Kevin Bourrillion
 * @since 1.0
 */
@GwtCompatible
public final class Ints extends IntsMethodsForWeb {
  private Ints() {}

  /**
   * The number of bytes required to represent a primitive {@code int} value.
   *
   * <p>Prefer {@link Integer#BYTES} instead.
   */
  public static final int BYTES = Integer.BYTES;

        assertNotNull(resp, "Instance should not be null");
    }

    /**
     * All wire‑format methods should return zero regardless of inputs.
     */
    @Nested
    @DisplayName("Wire format method behaviour")
    class WireFormatMethods {
        @ParameterizedTest
        @ValueSource(ints = { 0, 1, -1, Integer.MAX_VALUE, Integer.MIN_VALUE })
        @DisplayName("writeSetupWireFormat returns 0 for all indices")

        SmbSession result = transport.getSmbSession(ctx);
        assertSame(session, result);
        verify(transport).getSmbSession(eq(ctx));
    }

    // Edge inputs: null context returns null session per mock setup
    @Test
    @DisplayName("getSmbSession(ctx) with null context returns null as stubbed")
    void getSmbSession_byContext_null() {

package jcifs.smb1.smb1;

/**
 * Unit tests for {@link FileEntry}. The interface itself has no
 * implementation, so the tests exercise the contract via Mockito mocks.
 * Each method is exercised for normal inputs, extreme or edge cases, and
 * interaction verification.
 */
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertNull;
import static org.mockito.Mockito.mock;

        // Arrange: choose a small set of known DOS codes
        List<Integer> inputs = Arrays.asList(0x00000000, 0x00050001, 0x007b0001, 0x0BADF00D);
        @SuppressWarnings("unchecked")
        BiConsumer<Integer, Integer> consumer = mock(BiConsumer.class);

        // Act: for each input, if a mapping exists, notify the consumer
        for (int dos : inputs) {
            int nt = findNtStatusOrMinusOne(dos);
            if (nt != -1) {

    void lookup_returns_expected_message_for_known_codes(int code, String expectedMessage) {
        // Valid inputs: each known code must map to its documented message
        assertEquals(expectedMessage, lookupMessage(code).orElse(null));
    }

    @ParameterizedTest
    @ValueSource(ints = { -1, Integer.MIN_VALUE, Integer.MAX_VALUE })
    @DisplayName("Unknown codes: lookup returns empty Optional")

// GetSubSys - extracts subssystem info from given config string
func GetSubSys(s string) (subSys string, inputs []string, tgt string, e error) {
	tgt = Default
	if len(s) == 0 {
		return subSys, inputs, tgt, Errorf("input arguments cannot be empty")
	}
	inputs = strings.SplitN(s, KvSpaceSeparator, 2)

	subSystemValue := strings.SplitN(inputs[0], SubSystemSeparator, 2)
	subSys = subSystemValue[0]
	if !SubSystems.Contains(subSys) {

 *       stateless, and therefore thread-safe.
 *   <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes
 *       produce the same hash code for distinct inputs (a "collision"), every hash function strives
 *       to <i>some</i> degree to make this unlikely. (Without this condition, a function that
 *       always returns zero could be called a hash function. It is not.)
 * </ul>
 *

 *       stateless, and therefore thread-safe.
 *   <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes
 *       produce the same hash code for distinct inputs (a "collision"), every hash function strives
 *       to <i>some</i> degree to make this unlikely. (Without this condition, a function that
 *       always returns zero could be called a hash function. It is not.)
 * </ul>
 *