}

        // Test zero time separately - it's handled specially
        SMBUtil.writeTime(0L, buffer, 0);
        long readTime = SMBUtil.readTime(buffer, 0);
        // When writing 0, it writes 0 directly, and when reading 0, it returns negative offset
        assertEquals(-SmbConstants.MILLISECONDS_BETWEEN_1970_AND_1601, readTime);
    }

    @Test
    void testUTimeConversionRoundTrip() {

		if errors.Is(err, errNoHealRequired) {
			countNoHeal++
		}
		r.DiskCount += result.DiskCount
		r.SetCount += result.SetCount
		r.Before.Drives = append(r.Before.Drives, result.Before.Drives...)
		r.After.Drives = append(r.After.Drives, result.After.Drives...)
	}

	// No heal returned by all serverPools, return errNoHealRequired
	if countNoHeal == len(z.serverPools) {
		return r, errNoHealRequired
	}

### Windows

```sh
docker run \
  -p 9000:9000 \
  -p 9001:9001 \
  --name minio1 \

        ComponentUtil.getFessConfig().getApiJsonResponseHeaderList().forEach(e -> response.setHeader(e.getFirst(), e.getSecond()));
    }

    /**
     * Writes a JSON response.
     * @param status The status code.
     * @param t The throwable.
     */
    protected void writeJsonResponse(final int status, final Throwable t) {

            buf[index - i] = value;
            i--;
        }
        return n;
    }

    /**
     * Writes an octet array to the buffer.
     *
     * @param b the byte array to write
     * @param i the starting index in the array
     * @param l the number of bytes to write
     */
    public void writeOctetArray(final byte[] b, final int i, final int l) {
        System.arraycopy(b, i, buf, index, l);

        this.dictionaryManager = dictionaryManager;
        return this;
    }

    /**
     * Writes the content of this dictionary file to the provided output stream.
     *
     * @param out the output stream to write to
     * @throws IOException if an I/O error occurs during writing
     */
    public void writeOut(final WrittenStreamOut out) throws IOException {

   * be performed atomically on the returned map. Additionally, {@code size} and {@code
   * containsValue} are implemented as bulk read operations, and thus may fail to observe concurrent
   * writes.
   *
   * @return a serializable concurrent map having the requested features
   */
  public <K, V> ConcurrentMap<K, V> makeMap() {
    if (!useCustomMap) {

        assertDoesNotThrow(() -> outputStream.write(data, 0, -1)); // negative length, returns early
        assertDoesNotThrow(() -> outputStream.write(data, 0, 0)); // zero length, returns early

        // These should pass through to the underlying implementation
        assertDoesNotThrow(() -> outputStream.write(data, 0, 10)); // valid - will consume first mock (10)

    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
    // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about
    // twice as many reads and writes. But benchmarking shows that they usually perform better than

            this.buf[this.index - i] = value;
            i--;
        }
        return n;
    }

    /**
     * Writes an octet array to the buffer.
     *
     * @param b the byte array to write
     * @param i the starting index in the array
     * @param l the number of bytes to write
     */
    public void writeOctetArray(final byte[] b, final int i, final int l) {