if (entry.equals(v)) { // unless it's an entry point.
                        // currently processing the entry point - it should not have any entry incident edges
                        res.getEntry().getMd().setWhy("This is a graph entry point. No links.");
                    }
                } else {
                    // fill in domain md with actual version data
                    ArtifactMetadata md = v.getMd();

        // Clean up old consecutive failure counters
        consecutiveFailures.entrySet().removeIf(entry -> {
            String key = entry.getKey();
            Long lastFailure = lastFailureTimes.get(key);
            return lastFailure == null || now - lastFailure > FAILURE_RECOVERY_TIME * 2;
        });

        // Update connection metrics

          .containsAtLeastElementsIn(EnumSet.complementOf(EnumSet.of(UNNECESSARY)));
      for (Map.Entry<RoundingMode, Double> entry : expectedValues.entrySet()) {
        RoundingMode mode = entry.getKey();
        Double expectation = entry.getValue();
        assertWithMessage("roundToDouble(" + input + ", " + mode + ")")
            .that(BigDecimalMath.roundToDouble(input, mode))
            .isEqualTo(expectation);

            final StatsObject data = e.getValue();
            final Long begin = data.remove(BEGIN_KEY);
            if (begin != null) {
                printStats(e.getKey(), data, begin, false);
            }
        });

    }

    /**
     * Begins statistics tracking for the specified crawler object.
     * Creates a new statistics object in the cache and starts timing.

            throw new UncheckedExecutionException(e);
          }
        });

    CacheTesting.checkEmpty(cache);
    for (RemovalNotification<String, String> entry : notifications) {
      assertThat(entry.getKey()).isNotNull();
      assertThat(entry.getValue()).isNotNull();
    }
  }

  public void testComputeExceptionally() {
    assertThrows(
        RuntimeException.class,
        () ->

  }

  private void putAll(Iterable<Entry<K, V>> entries) {
    Map<K, V> map = new LinkedHashMap<>();
    for (Entry<K, V> entry : entries) {
      map.put(entry.getKey(), entry.getValue());
    }
    getMap().putAll(map);
  }

  /**
   * Returns the {@link Method} instance for {@link #testPutAll_nullKeyUnsupported()} so that tests

  }

  private void putAll(Iterable<Entry<K, V>> entries) {
    Map<K, V> map = new LinkedHashMap<>();
    for (Entry<K, V> entry : entries) {
      map.put(entry.getKey(), entry.getValue());
    }
    getMap().putAll(map);
  }

  /**
   * Returns the {@link Method} instance for {@link #testPutAll_nullKeyUnsupported()} so that tests

        this.releases = releases;
    }

    @Override
    public ArtifactRepositoryPolicy getReleases() {
        return releases;
    }

    @Override
    public String getKey() {
        return getId();
    }

    @Override
    public boolean isBlacklisted() {
        return blacklisted;
    }

    @Override
    public void setBlacklisted(boolean blacklisted) {

      if (delegate != null) {
        return delegate.entrySet().contains(o);
      } else if (o instanceof Entry) {
        Entry<?, ?> entry = (Entry<?, ?>) o;
        int index = indexOf(entry.getKey());
        return index != -1 && Objects.equals(value(index), entry.getValue());
      }
      return false;
    }

    @Override
    public boolean remove(@Nullable Object o) {

        
        for (Map.Entry<String, DirectoryCacheEntry> entry : directoryCache.entrySet()) {
            if (entry.getValue().isExpired()) {
                expiredPaths.add(entry.getKey());
            }
        }
        
        for (String path : expiredPaths) {
            releaseDirectoryLease(path);
        }
    }