import java.util.concurrent.ScheduledExecutorService;
import java.util.concurrent.Semaphore;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;

/**
 * Tests for {@link Uninterruptibles}.
 *
 * @author Anthony Zana

            }
        } finally {
            lock.writeLock().unlock();
        }
    }
    
    public List<FileInfo> getChildren() {
        lock.readLock().lock();
        try {
            lastAccessTime = System.currentTimeMillis();
            return new ArrayList<>(children.values());
        } finally {
            lock.readLock().unlock();
        }
    }
    

            lock.writeLock().unlock();
        }
    }

    /**
     * Release all leases
     */
    public void releaseAll() {
        lock.writeLock().lock();
        try {
            log.info("Releasing all {} leases", leases.size());
            leases.clear();
            pathToLease.clear();
        } finally {
            lock.writeLock().unlock();
        }
    }

    /**

            final byte[] sig = mac.doFinal();
            System.arraycopy(sig, 0, data, offset + SIGNATURE_OFFSET, SIGNATURE_LENGTH);
        } finally {
            this.signingLock.unlock();
        }
    }

    /**
     *
     * {@inheritDoc}
     *
     * @see jcifs.internal.SMBSigningDigest#verify(byte[], int, int, int, jcifs.internal.CommonServerMessageBlock)
     */

     * Iterable<Lock> locks = stripedLock.bulkGet(keys);
     * for (Lock lock : locks) {
     *   lock.lock();
     * }
     * operation();
     * for (Lock lock : locks) {
     *   lock.unlock();
     * }
     *
     * If we only held the int[] stripes, translating it on the fly to L's, the original locks might

        try {
          currentFuture.cancel(mayInterruptIfRunning);
        } finally {
          lock.unlock();
        }
      }

      @Override
      public boolean isCancelled() {
        lock.lock();
        try {
          return currentFuture.isCancelled();
        } finally {
          lock.unlock();
        }
      }
    }

    @Override
    final Cancellable schedule(

Similarly, the reader thread must never block on writing because this can deadlock the connection. Consider a client and server that both violate this rule. If you get unlucky, they could fill up their TCP buffers (so that writes block) and then use their reader threads to write a frame. Nobody is reading on either end, and the buffers are never drained.

#### Do-stuff-later pool

    /** LM compatibility level */
    int LM_COMPATIBILITY = Config.getInt("jcifs.smb1.smb.lmCompatibility", 3);

    /** No flags set */
    int FLAGS_NONE = 0x00;
    /** Lock and read write and unlock flag */
    int FLAGS_LOCK_AND_READ_WRITE_AND_UNLOCK = 0x01;
    /** Receive buffer posted flag */
    int FLAGS_RECEIVE_BUFFER_POSTED = 0x02;
    /** Path names are caseless flag */
    int FLAGS_PATH_NAMES_CASELESS = 0x08;

        try {
          currentFuture.cancel(mayInterruptIfRunning);
        } finally {
          lock.unlock();
        }
      }

      @Override
      public boolean isCancelled() {
        lock.lock();
        try {
          return currentFuture.isCancelled();
        } finally {
          lock.unlock();
        }
      }
    }

    @Override
    final Cancellable schedule(

func (c *LRU[K, V]) Contains(key K) (ok bool) {
	c.mu.Lock()
	defer c.mu.Unlock()
	_, ok = c.items[key]
	return ok
}

// Peek returns the key value (or undefined if not found) without updating
// the "recently used"-ness of the key.
func (c *LRU[K, V]) Peek(key K) (value V, ok bool) {
	c.mu.Lock()
	defer c.mu.Unlock()
	var ent *Entry[K, V]
	if ent, ok = c.items[key]; ok {
		// Expired item check