@Override
    public Entry<K, V>[] createArray(int length) {
      return generator.createArray(length);
    }

    @Override
    public Iterable<Entry<K, V>> order(List<Entry<K, V>> insertionOrder) {
      return generator.order(insertionOrder);
    }

    @SuppressWarnings("unchecked")
    @Override
    public K[] createKeyArray(int length) {
      return (K[]) new Object[length];
    }

    @SuppressWarnings("unchecked")

    public static String encode(final byte[] bytes) {
        int length = bytes.length;
        if (length == 0) {
            return "";
        }
        final StringBuilder buffer = new StringBuilder((int) Math.ceil(length / 3d) * 4);
        final int remainder = length % 3;
        length -= remainder;
        int block;
        int i = 0;
        while (i < length) {

        // Test with buffer and length larger than needed
        byte[] buffer = new byte[100];

        // Fill test pattern
        for (int i = 0; i < buffer.length; i++) {
            buffer[i] = (byte) (i % 256);
        }

        int bytesConsumed = response.decode(buffer, 0, 50);

        assertEquals(28, bytesConsumed, "Should consume exactly 28 bytes regardless of extra length");

     *
     * @param data The data.
     * @param offset The starting offset at which the SMB header begins.
     * @param length The length of the SMB data starting at offset.
     */
    void sign(final byte[] data, final int offset, final int length, final ServerMessageBlock request, final ServerMessageBlock response) {
        request.signSeq = signSequence;
        if (response != null) {

        @Test
        @DisplayName("Should handle negative length in verify method")
        void testVerifyNegativeLength() {
            byte[] data = new byte[128];
            boolean result = digest.verify(data, 0, -1, 0, response);
            assertFalse(result, "Should return false for negative length");
        }

        @Test
        @DisplayName("Should handle offset+length exceeding buffer size in verify method")

        if (blob != null) {
            System.arraycopy(blob, 0, dst, dstIndex, blob.length);
            dstIndex += blob.length;
        } else {
            System.arraycopy(lmHash, 0, dst, dstIndex, lmHash.length);
            dstIndex += lmHash.length;
            System.arraycopy(ntHash, 0, dst, dstIndex, ntHash.length);
            dstIndex += ntHash.length;

            dstIndex += writeString(accountName, dst, dstIndex);

     *
     * @param data the data buffer
     * @param offset the offset in the buffer
     * @param length the length of data to compress
     * @param algorithm the compression algorithm to use
     * @return the compressed data
     * @throws CIFSException if compression fails
     */
    byte[] compress(byte[] data, int offset, int length, int algorithm) throws CIFSException;

    /**

    @Override
    public Entry<K, V>[] createArray(int length) {
      return generator.createArray(length);
    }

    @Override
    public Iterable<Entry<K, V>> order(List<Entry<K, V>> insertionOrder) {
      return generator.order(insertionOrder);
    }

    @SuppressWarnings("unchecked")
    @Override
    public K[] createKeyArray(int length) {
      return (K[]) new Object[length];
    }

    @SuppressWarnings("unchecked")

            System.arraycopy(remarkBytes, 0, buffer, remarkOffset, remarkBytes.length);
            buffer[remarkOffset + remarkBytes.length] = 0;
            remarkOffset += remarkBytes.length + 1;
        }

        // Read the data
        int bytesRead = response.readDataWireFormat(buffer, 0, buffer.length);

        // Verify results
        assertTrue(bytesRead > 0);

        this.num_sids = sids.length;
        this.sids = new lsarpc.LsarSidPtr[sids.length];
        for (int si = 0; si < sids.length; si++) {
            this.sids[si] = new lsarpc.LsarSidPtr();
            this.sids[si].sid = sids[si].unwrap(sid_t.class);
        }
    }

    LsarSidArrayX(final SID[] sids) {
        this.num_sids = sids.length;
        this.sids = new lsarpc.LsarSidPtr[sids.length];