directoryLeaseManager.handleDirectoryChange(directoryPath, "file3.txt", DirectoryChangeNotifier.DirectoryChangeType.FILE_ADDED);
        assertFalse(entry.isComplete());

        // Re-setup for next test
        entry.updateChild("file1.txt", 1024L, 1000L, false, 0x20, 500L, 800L);
        entry.markComplete();

        // Test FILE_REMOVED

     * @param access the desired access rights
     * @param shareAccess the share access mode
     * @param extFileAttributes the extended file attributes
     * @param createOptions the create options
     * @param andx the next command in the chain
     */
    public SmbComNTCreateAndX(final Configuration config, final String name, final int flags, final int access, final int shareAccess,

        lenient().when(SmbTransport.getSmbTransport(uniAddress, 0)).thenReturn(smbTransport);

        DfsReferral referral = new DfsReferral();
        referral.server = "dc1.domain.com";
        referral.next = referral;
        lenient().when(smbTransport.getDfsReferrals(auth, "\\domain.com", 1)).thenReturn(referral);

        UniAddress dcAddress = mock(UniAddress.class);

	b.ReportAllocs()
	// the actual benchmark for PutObject starts here. Reset the benchmark timer.
	b.ResetTimer()

	b.RunParallel(func(pb *testing.PB) {
		i := 0
		for pb.Next() {
			// insert the object.
			objInfo, err := obj.PutObject(b.Context(), bucket, "object"+strconv.Itoa(i),
				mustGetPutObjReader(b, bytes.NewReader(textData), int64(len(textData)), md5hex, sha256hex), ObjectOptions{})

	}

	ageDelta, err := time.ParseDuration(minimumObjectAge)
	if err != nil {
		log.Fatalln(err)
	}

	maxObjectModTime := time.Now().Add(-ageDelta)

	// Next object is used to ignore new objects in the source & target
	nextObject := func(ch <-chan minio.ObjectInfo) (ctnt minio.ObjectInfo, ok bool) {
		for {
			ctnt, ok := <-ch
			if !ok {
				return minio.ObjectInfo{}, false

        override fun runOnce(): Long {
          block()
          return -1L
        }
      },
      delayNanos,
    )
  }

  /** Returns a latch that reaches 0 when the queue is next idle. */
  fun idleLatch(): CountDownLatch {
    taskRunner.withLock {
      // If the queue is already idle, that's easy.
      if (activeTask == null && futureTasks.isEmpty()) {
        return CountDownLatch(0)

    filtered.put("a", 2);
    filtered.put("b", 4);
    assertEquals(ImmutableMap.of("a", 2, "b", 4), filtered);

    Entry<String, Integer> entry = filtered.entrySet().iterator().next();
    assertThrows(IllegalArgumentException.class, () -> entry.setValue(5));

    assertEquals(ImmutableMap.of("a", 2, "b", 4), filtered);
  }

  public void testFilteredValuesClear() {

        impl.releaseBuffer(b);

        // Assert: original array is zeroed in-place
        for (byte value : b) {
            assertEquals(0, value, "Released buffer must be zeroed");
        }

        // Next get should return the same instance from cache
        byte[] reused = impl.getBuffer();
        assertSame(b, reused, "Buffer should be reused from cache");
        // And it should still be zeroed

    }

    // ensures that the number of invocations looks sane
    void assertInvariants(int expectedBytes) {
      // we should have seen as many bytes as the next multiple of chunk after expectedBytes - 1
      assertEquals(out.toByteArray().length, ceilToMultiple(expectedBytes, chunkSize));
      assertEquals(expectedBytes / chunkSize, processCalled);

  @CollectionSize.Require(SEVERAL)
  public void testDescendingNavigation() {
    List<E> descending = new ArrayList<>();
    for (Iterator<E> i = navigableSet.descendingIterator(); i.hasNext(); ) {
      descending.add(i.next());
    }
    Collections.reverse(descending);
    assertEquals(values, descending);
  }

  public void testEmptySubSet() {
    NavigableSet<E> empty = navigableSet.subSet(e0(), false, e0(), false);