}

  @CollectionSize.Require(SEVERAL)
  public void testHigherHole() {
    resetWithHole();
    assertEquals(c, navigableSet.higher(a));
    assertEquals(c, navigableSet.higher(b));
    assertEquals(null, navigableSet.higher(c));
  }

  /*
   * TODO(cpovirk): make "too small" and "too large" elements available for better navigation

        assertTrue("Minimum version should be at least SMB2.0.2", config.getMinimumVersion().atLeast(DialectVersion.SMB202));

        // Verify LM compatibility level is 3 or higher (NTLMv2 only)
        assertTrue("LM compatibility should be 3 or higher for NTLMv2 only", config.getLanManCompatibility() >= 3);
        assertEquals("LM compatibility should default to 3", 3, config.getLanManCompatibility());

 * extract additional metadata, or perform other transformations during the
 * indexing process.
 *
 * Ingesters are processed in priority order, with lower numbers having higher priority.
 */
public abstract class Ingester {

    /** Priority of this ingester (lower numbers = higher priority) */
    protected int priority = 99;

    /**
     * Default constructor.
     */
    public Ingester() {
        // Default constructor
    }

        projects.sort(comparator.getComparator());

        // Project A should come first (highest weight)
        assertEquals(
                ProjectDependencyGraphStub.A,
                projects.get(0),
                "Project A should be first (highest critical path weight)");

        // B and C should come before X (they have higher weights)
        assertTrue(

        return comparator;
    }

    /**
     * Gets the calculated weight for a project, representing its dependency chain length.
     *
     * @param project the project
     * @return the project's weight (higher means longer dependency chain)
     */
    public long getProjectWeight(MavenProject project) {
        // First check if weight is already calculated
        Long existingWeight = projectWeights.get(project);

  }

  @CollectionSize.Require(SEVERAL)
  public void testHigherHole() {
    resetWithHole();
    assertEquals(c, navigableSet.higher(a));
    assertEquals(c, navigableSet.higher(b));
    assertEquals(null, navigableSet.higher(c));
  }

  /*
   * TODO(cpovirk): make "too small" and "too large" elements available for better navigation

/**
 * Specifies the priority of a bean implementation when multiple implementations
 * of the same type are available.
 * <p>
 * Higher values indicate higher priority. When multiple implementations of the same
 * type exist, the one with the highest priority will be selected for injection.
 * <p>
 * Example usage:
 * <pre>
 * {@literal @}Priority(100)
 * public class PreferredImplementation implements Service {

  }

  @Override
  public @Nullable E lower(E element) {
    return forward.higher(element);
  }

  @Override
  public @Nullable E floor(E element) {
    return forward.ceiling(element);
  }

  @Override
  public @Nullable E ceiling(E element) {
    return forward.floor(element);
  }

  @Override
  public @Nullable E higher(E element) {
    return forward.lower(element);
  }

  @Override

  }

  @Override
  public @Nullable E higher(@ParametricNullness E e) {
    return delegate().higher(e);
  }

  /**
   * A sensible definition of {@link #higher} in terms of the {@code iterator} method of {@link
   * #tailSet(Object, boolean)}. If you override {@link #tailSet(Object, boolean)}, you may wish to
   * override {@link #higher} to forward to this implementation.
   */

public class LoadingCacheSingleThreadBenchmark {
  @Param({"1000", "2000"})
  int maximumSize;

  @Param("5000")
  int distinctKeys;

  @Param("4")
  int segments;

  // 1 means uniform likelihood of keys; higher means some keys are more popular
  // tweak this to control hit rate
  @Param("2.5")
  double concentration;

  Random random = new Random();

  LoadingCache<Integer, Integer> cache;

  int max;