func (w *Writer) Close() error {
	if w.last != nil && !w.last.closed {
		if err := w.last.close(); err != nil {
			return err
		}
		w.last = nil
	}
	if w.closed {
		return errors.New("zip: writer closed twice")
	}
	w.closed = true

	// write central directory
	start := w.cw.count
	for _, h := range w.dir {
		var buf [directoryHeaderLen]byte
		b := writeBuf(buf[:])
		b.uint32(uint32(directoryHeaderSignature))

	$(docker exec resiliency-minio$NODE-1 /bin/sh -c "cat $DIR/test-bucket/initial-data/$FILE/$UUID/part.1 | tail --bytes $TAIL_SIZE > /tmp/tail")

	# Corrupt the part by writing head twice followed by tail
	$(docker exec resiliency-minio$NODE-1 /bin/sh -c "cat /tmp/head /tmp/head /tmp/tail > $DIR/test-bucket/initial-data/$FILE/$UUID/part.1")
}

function test_resiliency_healing_induced_bitrot() {
	echo

        shareInfo1.encode(mockNdrBuffer);

        // Verify the encode operations
        verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer, times(2)).enc_ndr_referent(null, 1); // Called twice for netname and remark
        verify(mockNdrBuffer).enc_ndr_long(0);
        // Should not encode strings if fields are null
        verify(mockDeferredBuffer, never()).enc_ndr_string(anyString());
    }

    @Test

    }

    @Test
    public void testDifferentEncryptionsProduceDifferentCiphertexts() throws Exception {
        char[] plaintext = "SamePassword".toCharArray();

        // Encrypt twice
        byte[] encrypted1 = storage.encryptCredentials(plaintext.clone());
        byte[] encrypted2 = storage.encryptCredentials(plaintext.clone());

        // Should produce different ciphertexts due to random IV

        assertFalse(it.hasNext());

        // Verify interactions
        verify(tree, times(1)).send(isA(Trans2FindFirst2.class), any(Trans2FindFirst2Response.class));
        // Verify that Trans2FindNext2 was sent twice for fetching more entries
        verify(tree, times(2)).send(isA(Trans2FindNext2.class), any(Trans2FindFirst2Response.class));

        // Close should have sent FindClose2 exactly once

        assertTrue(values[1].startsWith("time:"));
        assertTrue(values[2].startsWith("done:"));

        // CrawlerStatsHelper uses LinkedHashMap which overwrites values with same key
        // Recording the same action twice will overwrite the first one
        assertTrue(values[3].startsWith("same_action:"));
        assertTrue(values[4].startsWith("different_action:"));
    }

    public void test_getUrlWithSpecialCharacters() {

    @DisplayName("Should produce consistent keys for same input")
    void testDeriveKeys_Consistency() {
        // Given
        int dialect = Smb2Constants.SMB2_DIALECT_0311;

        // When - derive same key twice
        byte[] signingKey1 = Smb3KeyDerivation.deriveSigningKey(dialect, sessionKey, preauthIntegrity);
        byte[] signingKey2 = Smb3KeyDerivation.deriveSigningKey(dialect, sessionKey, preauthIntegrity);

          signalledCallback = true
          responseCallback.onResponse(this@RealCall, response)
        } catch (e: IOException) {
          if (signalledCallback) {
            // Do not signal the callback twice!
            Platform.get().log("Callback failure for ${toLoggableString()}", Platform.INFO, e)
          } else {
            responseCallback.onFailure(this@RealCall, e)
          }
        } catch (t: Throwable) {

        boolean downloaded = false;

        try {
            connectWagon(wagon, repository);

            boolean firstRun = true;
            boolean retry = true;

            // this will run at most twice. The first time, the firstRun flag is turned off, and if the retry flag
            // is set on the first run, it will be turned off and not re-set on the second try. This is because the

		return 0
	}
	c := cap(b.buf)
	if n <= c/2-m {
		// We can slide things down instead of allocating a new
		// slice. We only need m+n <= c to slide, but
		// we instead let capacity get twice as large so we
		// don't spend all our time copying.
		copy(b.buf, b.buf[b.off:])
	} else if c > maxInt-c-n {
		panic(ErrTooLarge)
	} else {
		// Add b.off to account for b.buf[:b.off] being sliced off the front.