Stopwatch stopwatch = Stopwatch.createStarted();
    BlockingQueue<String> queue = new ArrayBlockingQueue<>(999);
    putUninterruptibly(queue, "");
    assertTimeNotPassed(stopwatch, LONG_DELAY_MS);
    assertThat(queue.peek()).isEqualTo("");
  }

  public void testPutNoInterrupt() {
    TimedPutQueue queue = TimedPutQueue.createWithDelay(20);
    queue.putSuccessfully();
    assertNotInterrupted();
  }

      this.queue = new ArrayDeque<>();
      queue.add(root);
    }

    @Override
    public boolean hasNext() {
      return !queue.isEmpty();
    }

    @Override
    public T peek() {
      return queue.element();
    }

    @Override
    public T next() {
      T result = queue.remove();
      Iterables.addAll(queue, children(result));
      return result;
    }
  }

   */
  private boolean finalizeReference(Reference<?> reference, Method finalizeReferentMethod) {
    /*
     * This is for the benefit of phantom references. Weak and soft references will have already
     * been cleared by this point.
     */
    reference.clear();

    if (reference == frqReference) {
      /*

  }

  private CacheBuilderFactory cacheFactory() {
    return new CacheBuilderFactory()
        .withKeyStrengths(ImmutableSet.of(Strength.STRONG, Strength.WEAK))
        .withValueStrengths(ImmutableSet.copyOf(Strength.values()))
        .withConcurrencyLevels(ImmutableSet.of(1, 4, 16, 64))
        .withMaximumSizes(ImmutableSet.of(0, 1, 10, 100, 1000))

     * @return the generated key
     * @throws IOException if an I/O error occurs
     */
    protected abstract long makeKey(Request request) throws IOException;

    /**
     * Peek at the next key without removing it from the input stream
     *
     * @return the next key or null if none available
     * @throws IOException if an I/O error occurs
     */

          if (taskFuture.isDone()) {
            // Since the value of oldFuture can only ever be immediateVoidFuture() or setFuture of a
            // future that eventually came from immediateVoidFuture(), this doesn't leak throwables
            // or completion values.
            newFuture.setFuture(oldFuture);
          } else if (outputFuture.isCancelled() && taskExecutor.trySetCancelled()) {

Diğer FastAPI endpoint'leri/*path operations* ile aynı şekilde çalışırlar:

{* ../../docs_src/websockets_/tutorial002_an_py310.py hl[68:69,82] *}

/// info

Bu bir WebSocket olduğu için `HTTPException` raise etmek pek anlamlı değildir; bunun yerine `WebSocketException` raise ederiz.

[Spesifikasyonda tanımlanan geçerli kodlar](https://tools.ietf.org/html/rfc6455#section-7.4.1) arasından bir kapatma kodu kullanabilirsiniz.

///

 *   <li>time-based expiration of entries, measured since last access or last write
 *   <li>keys automatically wrapped in {@linkplain WeakReference weak} references
 *   <li>values automatically wrapped in {@linkplain WeakReference weak} or {@linkplain
 *       SoftReference soft} references
 *   <li>notification of evicted (or otherwise removed) entries
 *   <li>accumulation of cache access statistics
 * </ul>

    assertThat(cache.getUnchecked(one)).isSameInstanceAs(one);
    assertThat(segment.recencyQueue.isEmpty()).isTrue();
    assertThat(map.get(one)).isSameInstanceAs(one);
    assertThat(segment.recencyQueue.peek().getKey()).isSameInstanceAs(one);
    assertThat(cache.getUnchecked(one)).isSameInstanceAs(one);
    assertThat(segment.recencyQueue.isEmpty()).isFalse();
  }

    assertThat(cache.getUnchecked(one)).isSameInstanceAs(one);
    assertThat(segment.recencyQueue.isEmpty()).isTrue();
    assertThat(map.get(one)).isSameInstanceAs(one);
    assertThat(segment.recencyQueue.peek().getKey()).isSameInstanceAs(one);
    assertThat(cache.getUnchecked(one)).isSameInstanceAs(one);
    assertThat(segment.recencyQueue.isEmpty()).isFalse();
  }