r t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!l.test(t||n&&n.nodeName||"HTML")},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(c(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:le}),"function"==typeof...

     *
     * @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;

    /**

            });

            HMACT64 hmac = new HMACT64(TEST_KEY);
            int bytesWritten = hmac.engineDigest(buffer, 0, expectedOutput.length);

            assertEquals(expectedOutput.length, bytesWritten);
            assertArrayEquals(expectedOutput, Arrays.copyOfRange(buffer, 0, expectedOutput.length));

            verify(mockMd5, times(1)).digest(); // First call for inner digest

      ensureRoomFor(values.length());
      System.arraycopy(values.array, values.start, array, count, values.length());
      count += values.length();
      return this;
    }

    private void ensureRoomFor(int numberToAdd) {
      int newCount = count + numberToAdd; // TODO(kevinb): check overflow now?
      if (newCount > array.length) {

      ensureRoomFor(values.length());
      System.arraycopy(values.array, values.start, array, count, values.length());
      count += values.length();
      return this;
    }

    private void ensureRoomFor(int numberToAdd) {
      int newCount = count + numberToAdd; // TODO(kevinb): check overflow now?
      if (newCount > array.length) {

    }

    /**
     * Returns the length of data in the buffer.
     *
     * @return the data length
     */
    public int getLength() {
        return deferred.length;
    }

    /**
     * Sets the length of data in the buffer.
     *
     * @param length the new data length
     */
    public void setLength(final int length) {
        deferred.length = length;
    }

    /**

    assertEquals(expected.length(), reader.skip(Long.MAX_VALUE));
    assertFullyRead(reader);

    // skip 5 and read the rest
    if (expected.length() > 5) {
      reader = new CharSequenceReader(charSequence);
      assertEquals(5, reader.skip(5));

      buf = new char[expected.length() - 5];
      assertEquals(buf.length, reader.read(buf, 0, buf.length));

                + (challengeBytes == null ? "null" : "<" + challengeBytes.length + " bytes>") + ",context="
                + (contextBytes == null ? "null" : "<" + contextBytes.length + " bytes>") + ",targetInformation="
                + (targetInformationBytes == null ? "null" : "<" + targetInformationBytes.length + " bytes>") + ",flags=0x"
                + jcifs.util.Hexdump.toHexString(getFlags(), 8) + "]";
    }

                offset += name.length;
            }

            // Write data if present
            if (data != null && data.length > 0) {
                System.arraycopy(data, 0, dst, offset, data.length);
                offset += data.length;
            }

            // Pad to 8-byte boundary
            while ((offset - dstIndex) % 8 != 0) {
                dst[offset++] = 0;
            }

        byte[] buffer = new byte[10 + paramBytes.length + dataLen];
        // copy params
        System.arraycopy(paramBytes, 0, buffer, 10, paramBytes.length);
        // copy data
        System.arraycopy(dataBytes, 0, buffer, 10 + paramBytes.length, Math.min(dataBytes.length, dataLen));
        return buffer;
    }