testBlock = new TestAndXServerMessageBlock(mockConfig, (byte) 0x25);
        byte[] buffer = new byte[1024];

        int length = testBlock.encode(buffer, 0);

        assertTrue(length > 0);
        // Just verify that encoding worked without checking specific byte positions
        assertNull(testBlock.getAndx());
    }

    @Test
    @DisplayName("Test encode with andx command and batching disabled")

    void testEncodeSourceOffsetBeyondLength() {
        // Test with source offset + length exceeding source array bounds
        byte[] data = { 0x01, 0x02 };
        // This constructor call itself should not throw an error, as it's just storing the values.
        // The error should occur when System.arraycopy is called.
        ByteEncodable encodable = new ByteEncodable(data, 1, 2); // off=1, len=2, data.length=2. 1+2 > 2

        byte[] dest = new byte[5];

        // Test get(String url) method
        String url = "smb://server/share/file.txt";
        SmbResource mockSmbResource = mock(SmbFile.class);
        // Mocking SmbFile constructor is tricky, so we'll just verify the call to the delegate
        // and ensure no exception is thrown for a valid URL.
        // The actual SmbFile creation is outside the scope of this wrapper's direct responsibility.

        assertEquals(newPosition, smbRandomAccessFile.getFilePointer());
    }

    @Test
    void testSeekNegativePosition() throws SmbException {
        // seek doesn't throw exception for negative position, it just sets it
        smbRandomAccessFile.seek(-1);
        assertEquals(-1, smbRandomAccessFile.getFilePointer());
    }

    @Test
    void testReadByte() throws SmbException {

# set in the shell environment, those variables will be restored after the
# TFCI env has been loaded. This is useful for e.g. on-demand "generic" jobs
# where the user may wish to change just one option.
if [[ -z "${TFCI:-}" ]]; then
  echo '==TFCI==: The $TFCI variable is not set. This is fine as long as you'
  echo 'already sourced a TFCI env file with "set -a; source <path>; set +a".'

          CharStreams.copy(reader, sb);
        }
        return sb.toString();
      }
    },
    // It really seems like this should be faster than TO_BYTE_ARRAY_NEW_STRING.  But it just isn't
    // my best guess is that the jdk authors have spent more time optimizing that callpath than this
    // one. (StringCoding$StringDecoder vs. StreamDecoder).  StringCoding has a ton of special cases

    assertTrue(Ascii.equalsIgnoreCase(new String(IGNORED), new String(IGNORED)));
    // Compare to: "\u00c1".equalsIgnoreCase("\u00e1") == true
    assertFalse(Ascii.equalsIgnoreCase("\u00c1", "\u00e1"));
    // Test chars just outside the alphabetic range ('A'-1 vs 'a'-1, 'Z'+1 vs 'z'+1)
    assertFalse(Ascii.equalsIgnoreCase("@", "`"));
    assertFalse(Ascii.equalsIgnoreCase("[", "{"));
  }

    bits += signifRounded;
    /*
     * If signifRounded == 2^53, we'd need to set all of the significand bits to zero and add 1 to
     * the exponent. This is exactly the behavior we get from just adding signifRounded to bits
     * directly. If the exponent is MAX_DOUBLE_EXPONENT, we round up (correctly) to
     * Double.POSITIVE_INFINITY.
     */
    bits |= x.signum() & SIGN_MASK;

    assertTrue(Ascii.equalsIgnoreCase(new String(IGNORED), new String(IGNORED)));
    // Compare to: "\u00c1".equalsIgnoreCase("\u00e1") == true
    assertFalse(Ascii.equalsIgnoreCase("\u00c1", "\u00e1"));
    // Test chars just outside the alphabetic range ('A'-1 vs 'a'-1, 'Z'+1 vs 'z'+1)
    assertFalse(Ascii.equalsIgnoreCase("@", "`"));
    assertFalse(Ascii.equalsIgnoreCase("[", "{"));
  }

    private final Map<Name, NbtAddress> table = new HashMap<>();
    private long lastModified = 1L;
    private int alt;

    /**
     * This is really just for {@link jcifs.netbios.UniAddress}. It does
     * not throw an {@link java.net.UnknownHostException} because this
     * is queried frequently and exceptions would be rather costly to
     * throw on a regular basis here.