writeOrCountBytes(sink, false)
  }

  /**
   * Either writes this request to [sink] or measures its content length. We have one method do
   * double-duty to make sure the counting and content are consistent, particularly when it comes
   * to awkward operations like measuring the encoded length of header strings, or the
   * length-in-digits of an encoded integer.
   */
  @Throws(IOException::class)

    inputFuture = null;

    if (localInputFuture.isCancelled()) {
      @SuppressWarnings("unchecked")
      boolean unused =
          setFuture((ListenableFuture<O>) localInputFuture); // Respects cancellation cause setting
      return;
    }

    /*
     * Any of the setException() calls below can fail if the output Future is cancelled between now

                // Implementation for raw payload
            }

            @Override
            public byte[] getRawPayload() {
                // Implementation for getting raw payload
                return null;
            }

            @Override
            public boolean isRetainPayload() {
                // Implementation for retain payload flag

    object : Task("$okHttpName ConnectionPool connection closer") {
      override fun runOnce(): Long = closeConnections(System.nanoTime())
    }

  /**
   * Holding the lock of the connection being added or removed when mutating this, and check its
   * [RealConnection.noNewExchanges] property. This defends against races where a connection is
   * simultaneously adopted and removed.
   */

      return true;
    }

    boolean get(long bitIndex) {
      return (data.get((int) (bitIndex >>> LONG_ADDRESSABLE_BITS)) & (1L << bitIndex)) != 0;
    }

    /**
     * Careful here: if threads are mutating the atomicLongArray while this method is executing, the
     * final long[] will be a "rolling snapshot" of the state of the bit array. This is usually good
     * enough, but should be kept in mind.
     */

```java
// Include patterns (must match)
crawler.urlFilter.addInclude("https://example.com/.*");

// Exclude patterns (must not match)
crawler.urlFilter.addExclude(".*\\.(css|js|png|jpg)$");
```

### Setting Crawl Limits

```java
context.setMaxAccessCount(1000);  // Max URLs (0 = unlimited)
context.setMaxDepth(3);           // Max depth (-1 = unlimited)
context.setNumOfThread(10);       // Concurrent threads
```

import java.util.LinkedHashMap;
import java.util.Map;
import java.util.TreeMap;
import java.util.WeakHashMap;
import java.util.concurrent.ConcurrentHashMap;

/**
 * Utility class for easily creating and setting values in {@link Map} instances.
 * <p>
 * By statically importing this class, you can easily initialize {@literal Map} instances as follows:
 * </p>
 *
 * <pre>
 * import static org.codelibs.core.collection.Maps.*;

        // Ensure arrays are independent: mutate clone's buffer via getter
        copy.get()[1] = 77;
        assertNotEquals(original.toString(), copy.toString(), "Mutating clone should not affect original");
    }

    // Uses reflection to set internal array to null to exercise defensive branch in length()
    @Test
    @DisplayName("length(): handles internal null defensively")

        final byte[] tail = new byte[padLen + 8];
        tail[0] = (byte) 0x80;

        // append length before final transform:
        // save number of bits, casting the long to an array of 8 bytes
        // save low-order byte first.
        for (int i = 0; i < 8; i++) {
            tail[padLen + i] = (byte) (count * 8 >>> 8 * i);
        }

    }

    @Test
    @DisplayName("close calls release and decrements usage; double release throws")
    void closeAndReleaseBehavior() {
        // Validates usage counting and that an extra release() throws RuntimeCIFSException
        // First close -> usage 1 -> 0, triggers treeConnection.release()
        handle.close();
        verify(treeConnection, times(1)).release();