void testEncodeMultipleChunks() {
            // Given
            SrvCopychunk chunk1 = new SrvCopychunk(100, 200, 300);
            SrvCopychunk chunk2 = new SrvCopychunk(400, 500, 600);
            SrvCopychunk chunk3 = new SrvCopychunk(700, 800, 900);
            SrvCopychunkCopy copy = new SrvCopychunkCopy(sourceKey, chunk1, chunk2, chunk3);

            // When

 * copy operations with multiple chunk specifications.
 *
 * @author mbechler
 *
 */
public class SrvCopychunkCopy implements Encodable {

    private final byte[] sourceKey;
    private final SrvCopychunk[] chunks;

    /**
     * Constructs a server copy chunk operation request
     * @param sourceKey the resume key identifying the source file
     * @param chunks the array of copy chunk descriptors
     */

                            wsize = byteLimit;
                        }

                        int chunks = (int) (wsize / maxChunkSize);
                        int lastChunkSize;
                        if (chunks + 1 > maxChunks) {
                            chunks = maxChunks;
                            lastChunkSize = maxChunkSize;
                        } else {

        }

        @Test
        @DisplayName("Should handle mismatched chunk and total bytes")
        void testMismatchedValues() throws SMBProtocolDecodingException {
            // This could happen if the last chunk is smaller
            byte[] buffer = createValidCopyChunkResponse(10, // 10 chunks
                    65536, // Last chunk size (not average)
                    589824 // Total less than 10 * 65536
            );

    private int totalBytesWritten;

    /**
     * Gets the number of bytes written in the last chunk
     * @return the chunkBytesWritten
     */
    public int getChunkBytesWritten() {
        return this.chunkBytesWritten;
    }

    /**
     * Gets the number of chunks successfully written
     * @return the chunksWritten
     */
    public int getChunksWritten() {

    z += shiftMix(v[1]) * K1;
    x = rotateRight(z + x, 39) * K1;
    y = rotateRight(y, 33) * K1;

    // Decrease length to the nearest multiple of 64, and operate on 64-byte chunks.
    length = (length - 1) & ~63;
    do {
      x = rotateRight(x + y + v[0] + load64(bytes, offset + 16), 37) * K1;
      y = rotateRight(y + v[1] + load64(bytes, offset + 48), 42) * K1;
      x ^= w[1];

			bucketName      string
			objName         string
			uploadID        string
			expectedErrType error
		}{bucket, "\\", uploadID, InvalidUploadID{}})
	}

	// Iterating over creatPartCases to generate multipart chunks.
	for i, testCase := range abortTestCases {
		err = obj.AbortMultipartUpload(context.Background(), testCase.bucketName, testCase.objName, testCase.uploadID, opts)
		if testCase.expectedErrType == nil && err != nil {

  /**
   * Parses a serialized trie representation of a map of reversed public suffixes into an immutable
   * map of public suffixes. The encoded trie string may be broken into multiple chunks to avoid the
   * 64k limit on string literal size. In-memory strings can be much larger (2G).
   */
  static ImmutableMap<String, PublicSuffixType> parseTrie(CharSequence... encodedChunks) {

                new_size = len + used;
            }
            tmp = pipe_buf;
            pipe_buf = new byte[new_size];
            i = tmp.length - beg_idx;
            if (used > i) { /* 2 chunks */
                System.arraycopy(tmp, beg_idx, pipe_buf, 0, i);
                System.arraycopy(tmp, 0, pipe_buf, i, used - i);
            } else {
                System.arraycopy(tmp, beg_idx, pipe_buf, 0, used);

    z += shiftMix(v[1]) * K1;
    x = rotateRight(z + x, 39) * K1;
    y = rotateRight(y, 33) * K1;

    // Decrease length to the nearest multiple of 64, and operate on 64-byte chunks.
    length = (length - 1) & ~63;
    do {
      x = rotateRight(x + y + v[0] + load64(bytes, offset + 16), 37) * K1;
      y = rotateRight(y + v[1] + load64(bytes, offset + 48), 42) * K1;
      x ^= w[1];