call: Call,
    cachedResponse: Response,
  ) = onEvent(CacheConditionalHit(System.nanoTime(), call))

  override fun retryDecision(
    call: Call,
    exception: IOException,
    retry: Boolean,
  ) = onEvent(RetryDecision(System.nanoTime(), call, exception, retry))

  override fun followUpDecision(
    call: Call,
    networkResponse: Response,
    nextRequest: Request?,

    try {
      return block()
    } finally {
      typeHintStack.removeAt(typeHintStack.size - 1)
    }
  }

  private fun sink(): BufferedSink = stack[stack.size - 1]

  fun writeBoolean(b: Boolean) {
    sink().writeByte(if (b) -1 else 0)
  }

  fun writeBigInteger(value: BigInteger) {
    sink().write(value.toByteArray())
  }

  fun writeLong(v: Long) {
    val sink = sink()

          return null;
        },
        /* userPassedSupplier= */ false);
  }

  private static <T extends Throwable> T doAssertThrows(
      Class<T> expectedThrowable, ThrowingSupplier supplier, boolean userPassedSupplier) {
    checkNotNull(expectedThrowable);
    checkNotNull(supplier);
    Predicate<Throwable> predicate = INSTANCE_OF.get(expectedThrowable);
    if (predicate == null) {

  // TODO(kak): Implement and benchmark the hashFoo() shortcuts.

  @Override
  public String toString() {
    return "Hashing.sipHash" + c + "" + d + "(" + k0 + ", " + k1 + ")";
  }

  @Override
  public boolean equals(@Nullable Object object) {
    if (object instanceof SipHashFunction) {
      SipHashFunction other = (SipHashFunction) object;
      return (c == other.c) && (d == other.d) && (k0 == other.k0) && (k1 == other.k1);
    }

      return sourceFormat.to(targetFormat, s);
    }

    @Override
    protected String doBackward(String s) {
      return targetFormat.to(sourceFormat, s);
    }

    @Override
    public boolean equals(@Nullable Object obj) {
      if (obj instanceof StringConverter) {
        StringConverter that = (StringConverter) obj;
        return sourceFormat.equals(that.sourceFormat) && targetFormat.equals(that.targetFormat);

        @DisplayName("Should indicate if share is in DFS")
        void testIsShareDfs() {
            // Given
            when(mockResponse.isShareDfs()).thenReturn(true);

            // When
            boolean isDfs = mockResponse.isShareDfs();

            // Then
            assertTrue(isDfs, "Should indicate DFS status");
            verify(mockResponse).isShareDfs();
        }

        @Test

     *
     * @param sessionId session identifier
     * @return true if key exists
     */
    public boolean hasSessionKey(String sessionId) {
        checkNotClosed();
        return sessionKeys.containsKey(sessionId) || (keyStore != null && keyStoreContainsKey(sessionId));
    }

    private boolean keyStoreContainsKey(String sessionId) {
        try {
            return keyStore.containsAlias("smb.session." + sessionId);

    }
    return classes;
  }

  private static boolean hasTest(Class<?> testClass, Iterable<String> testNames) {
    for (String testName : testNames) {
      try {
        testClass.getMethod(testName);
        return true;
      } catch (NoSuchMethodException e) {
        continue;
      }
    }
    return false;
  }

  private static boolean isEqualsDefined(Class<?> cls) {
    try {

    // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches
    // the slower pointer, then there's a loop.
    Throwable slowPointer = throwable;
    boolean advanceSlowPointer = false;

    Throwable cause;
    while ((cause = throwable.getCause()) != null) {
      throwable = cause;

      if (throwable == slowPointer) {

        void testConcurrentAccess() throws InterruptedException {
            // Given
            int threadCount = 10;
            Thread[] threads = new Thread[threadCount];
            boolean[] success = new boolean[threadCount];

            for (int i = 0; i < threadCount; i++) {
                final int index = i;
                threads[i] = new Thread(() -> {
                    try {