request: Request, call_next: Callable[[Request], Awaitable[Response]]
        ) -> Response:
            start_time = time.time()
            response = await call_next(request)
            process_time = time.time() - start_time
            response.headers["X-Process-Time"] = str(process_time)
            return response
        ```
        """

   *
   * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
   * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
   * spent a lot of time benchmarking your specific needs, use one of those instead.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,

 * AbstractMapBasedMultimap} calls {@link #createCollection()} to create the collection of values
 * for that key. The subclass should not call {@link #createCollection()} directly, and a new
 * instance should be created every time the method is called.
 *
 * <p>For example, the subclass could pass a {@link java.util.TreeMap} during construction, and
 * {@link #createCollection()} could return a {@link java.util.TreeSet}, in which case the

    /** Property key for SMB denied SID entries. */
    public static final String SMB_DENIED_SID_ENTRIES = "smbDeniedSidEntries";

    /** Property key for SMB file creation time. */
    public static final String SMB_CREATE_TIME = "smbCreateTime";

    /** Property key for SMB owner attributes. */
    public static final String SMB_OWNER_ATTRIBUTES = "smbOwnerAttributes";

import com.google.errorprone.annotations.ForOverride;
import com.google.errorprone.annotations.concurrent.GuardedBy;
import com.google.j2objc.annotations.WeakOuter;
import java.time.Duration;
import java.util.concurrent.Executor;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.TimeoutException;
import org.jspecify.annotations.Nullable;

/**

            Graph graph, Graph.Vertex before, Graph.Vertex after, Collection<Lifecycle.Phase> phases) {
        // We add ordering between internal phases.
        // This would be wrong at execution time, but we are here computing a list and not a graph,
        // so in order to obtain the expected order, we add these links between phases.
        Lifecycle.Phase prev = null;
        for (Lifecycle.Phase child : phases) {

        // When
        TimeZone resultTimeZone = delegatingConfig.getLocalTimezone();

        // Then
        assertSame(timeZone, resultTimeZone, "Should delegate time zone");
        verify(mockDelegate).getLocalTimezone();
    }

    @Test
    @DisplayName("Batch limit configuration should delegate correctly")
    void testBatchLimitDelegation() {
        // Given

// MD5 checksum of everything it reads as ETag.
//
// It also computes the SHA256 checksum of everything it reads
// if sha256Hex is not the empty string.
//
// If size resp. actualSize is unknown at the time of calling
// NewReader then it should be set to -1.
// When size is >=0 it *must* match the amount of data provided by r.
//
// NewReader may try merge the given size, MD5 and SHA256 values

pkg time, const ANSIC = "Mon Jan _2 15:04:05 2006"
pkg time, const April = 4
pkg time, const August = 8
pkg time, const December = 12
pkg time, const February = 2
pkg time, const Friday = 5
pkg time, const Hour = 3600000000000
pkg time, const January = 1
pkg time, const July = 7
pkg time, const June = 6
pkg time, const Kitchen = "3:04PM"
pkg time, const March = 3

    private long accessTime = Long.MAX_VALUE;

    @Override
    public long getAccessTime() {
      return accessTime;
    }

    @Override
    public void setAccessTime(long time) {
      this.accessTime = time;
    }

    private ReferenceEntry<K, V> nextAccess = nullEntry();

    @Override
    public ReferenceEntry<K, V> getNextInAccessQueue() {
      return nextAccess;
    }