* under the License.
 */
package org.apache.maven.lifecycle.internal;

import java.util.Comparator;
import java.util.List;

/**
 * Compares phases within the context of a specific lifecycle with secondary sorting based on the {@link PhaseId}.
 */
public class PhaseComparator implements Comparator<String> {
    /**
     * The lifecycle phase ordering.
     */
    private final List<String> lifecyclePhases;

    /**

    }

    public void test_methodStringSetterGet() {
        // Test String-based method setter with GET
        RequestData data = new RequestData();
        data.setMethod(Constants.GET_METHOD);
        assertEquals(Method.GET, data.getMethod());
    }

    public void test_methodStringSetterPost() {
        // Test String-based method setter with POST
        RequestData data = new RequestData();

import org.mockito.junit.jupiter.MockitoExtension;

@ExtendWith(MockitoExtension.class)
class SmbFileFilterTest {

    @Mock
    private SmbFile smbFile;

    // Provides file names and whether a simple name-based filter should accept them
    private static Stream<Arguments> nameCases() {
        return Stream.of(Arguments.of("readme.txt", true), Arguments.of("notes.log", false), Arguments.of("", false),

  /** Maximum size of a compact hash-based collection (2^30 - 1 because 0 is UNSET). */
  static final int MAX_SIZE = Ints.MAX_POWER_OF_TWO - 1;

  /** Default size of a compact hash-based collection. */
  static final int DEFAULT_SIZE = 3;

  /**
   * Minimum size of the hash table of a compact hash-based collection. Because small hash tables

# GraphQL { #graphql }

As **FastAPI** is based on the **ASGI** standard, it's very easy to integrate any **GraphQL** library also compatible with ASGI.

You can combine normal FastAPI *path operations* with GraphQL on the same application.

/// tip

**GraphQL** solves some very specific use cases.

It has **advantages** and **disadvantages** when compared to common **web APIs**.

- Choice of erasure set size is automatic based on the number of drives available, let's say for example if there are 32 servers and 32 drives which is a total of 1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*.

  /** Returns the platform preferred implementation of a map based on a hash table. */
  static <K extends @Nullable Object, V extends @Nullable Object>
      Map<K, V> newHashMapWithExpectedSize(int expectedSize) {
    return Maps.newHashMapWithExpectedSize(expectedSize);
  }

  /**
   * Returns the platform preferred implementation of an insertion ordered map based on a hash
   * table.
   */

      {
        "subprojects": [
          "base-ide-plugins",
          "build-process-services",
          "configuration-cache-base",
          "configuration-problems-base",
          "docs-asciidoctor-extensions-base",
          "gradle-cli",
          "logging-api",
          "plugin-development",
          "problems-rendering",
          "test-suites-base",
          "tooling-api-builders"
        ],

       safe, it needs to re-run.

       - This is unfortunate, because actually it would be safe to declare
       the task as up-to-date, because these two files, which are based on
       the generated index.xml, are outputs, not inputs. We can be sure of
       this because they are deleted in the @BeforeEach method of the
       OsgiTest test class.

import com.google.common.collect.testing.testers.QueueRemoveTester;
import com.google.errorprone.annotations.CanIgnoreReturnValue;
import java.util.ArrayList;
import java.util.List;

/**
 * Creates, based on your criteria, a JUnit test suite that exhaustively tests a queue
 * implementation.
 *
 * @author Jared Levy
 */
@GwtIncompatible
public final class QueueTestSuiteBuilder<E>