appropriateness of using or redistributing the Work and assume any
      risks associated with Your exercise of permissions under this License.

   8. Limitation of Liability. In no event and under no legal theory,
      whether in tort (including negligence), contract, or otherwise,
      unless required by applicable law (such as deliberate and grossly

      appropriateness of using or redistributing the Work and assume any
      risks associated with Your exercise of permissions under this License.

   8. Limitation of Liability. In no event and under no legal theory,
      whether in tort (including negligence), contract, or otherwise,
      unless required by applicable law (such as deliberate and grossly

      appropriateness of using or redistributing the Work and assume any
      risks associated with Your exercise of permissions under this License.

   8. Limitation of Liability. In no event and under no legal theory,
      whether in tort (including negligence), contract, or otherwise,
      unless required by applicable law (such as deliberate and grossly

    assertThat(listener.getCount()).isEqualTo(0);
    table.set(0, entryTwo);
    assertThat(segment.reclaimKey(entryThree, hashThree)).isFalse();
    assertThat(listener.getCount()).isEqualTo(0);

    // present
    table.set(0, entryOne);
    segment.count = 1;
    assertThat(segment.reclaimKey(entryOne, hashOne)).isTrue();
    assertThat(listener.getCount()).isEqualTo(1);

    assertThat(listener.getCount()).isEqualTo(0);
    table.set(0, entryTwo);
    assertThat(segment.reclaimKey(entryThree, hashThree)).isFalse();
    assertThat(listener.getCount()).isEqualTo(0);

    // present
    table.set(0, entryOne);
    segment.count = 1;
    assertThat(segment.reclaimKey(entryOne, hashOne)).isTrue();
    assertThat(listener.getCount()).isEqualTo(1);

 * </ul>
 *
 * <p>Note that detection of potential deadlock does not necessarily indicate that deadlock will
 * happen, as it is possible that higher level application logic prevents the cyclic lock
 * acquisition from occurring. One example of a false positive is:
 *
 * <pre>
 * LockA -&gt; LockB -&gt; LockC
 * LockA -&gt; LockC -&gt; LockB
 * </pre>
 *

    }

    @Override
    @ParametricNullness
    public V getValue() {
      Map<K, V> delegate = delegateOrNull();
      if (delegate != null) {
        /*
         * The cast is safe because the entry is present in the map. Or, if it has been removed by a
         * concurrent modification, behavior is undefined.
         */
        return uncheckedCastNullableTToT(delegate.get(key));
      }
      updateLastKnownIndex();

  private static String scopeWithDelimiter(Inet6Address ip) {
    // getHostAddress on android sometimes maps the scope ID to an invalid interface name; if the
    // mapped interface isn't present, fallback to use the scope ID (which has no validation against
    // present interfaces)
    NetworkInterface scopedInterface = ip.getScopedInterface();
    if (scopedInterface != null) {
      return "%" + scopedInterface.getName();
    }

            return this.isExists;
        }

        // Fast path for already resolved existence with recent cache
        if (this.isExists && (currentTime - (this.attrExpiration - getContext().getConfig().getAttributeCacheTimeout())) < 5000) {
            log.trace("Using recent positive existence cache");
            return true;
        }

        this.attributes = ATTR_READONLY | ATTR_DIRECTORY;

            }
            return time;
        }
        return -1;
    }

    /**
     * Retrieves a list of access results from the data service for processing.
     * Filters out results that are too recent based on commit margin time and manages crawler throttling.
     *
     * @param cb the consumer to customize the search request
     * @param cleanupTime the time taken for the last cleanup operation