* recognized public suffix; see {@link InternetDomainName#isPublicSuffix()} for details.
 *
 * <p>Note that no network lookups are performed by any {@code HostSpecifier} methods. No attempt is
 * made to verify that a provided specifier corresponds to a real or accessible host. Only syntactic
 * and pattern-based checks are performed.
 *
 * <p>If you know that a given string represents a numeric IP address, use {@link InetAddresses} to

    // First, ensure that our classloaders are initializing the correct helper versions:

    checkHelperVersion(getClass().getClassLoader(), "SafeAtomicHelper");
    checkHelperVersion(NO_ATOMIC_FIELD_UPDATER, "SynchronizedAtomicHelper");

    // Then, run the actual tests under each alternative classloader:

    runTestMethod(NO_ATOMIC_FIELD_UPDATER);
    // TODO(lukes): assert that the logs are full of errors
  }

  /**

## How are drives used for Erasure Code?

MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives.  Therefore, the number of drives you present must be a multiple of one of these numbers.  Each object is written to a single erasure-coding set.

        // Then
        assertNotNull(msrpcSamrOpenAlias, "MsrpcSamrOpenAlias object should not be null");

        // Verify that ptype and flags are set correctly using reflection
        try {
            java.lang.reflect.Field ptypeField = jcifs.dcerpc.DcerpcMessage.class.getDeclaredField("ptype");
            ptypeField.setAccessible(true);

/**
 * Static methods pertaining to sorted {@link List} instances.
 *
 * <p>In this documentation, the terms <i>greatest</i>, <i>greater</i>, <i>least</i>, and
 * <i>lesser</i> are considered to refer to the comparator on the elements, and the terms
 * <i>first</i> and <i>last</i> are considered to refer to the elements' ordering in a list.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
final class SortedLists {
  private SortedLists() {}

   * the lock acquisition graph.
   */
  private static final class LockGraphNode {

    /**
     * The map tracking the locks that are known to be acquired before this lock, each associated
     * with an example stack trace. Locks are weakly keyed to allow proper garbage collection when
     * they are no longer referenced.
     */
    final Map<LockGraphNode, ExampleStackTrace> allowedPriorLocks =
        new MapMaker().weakKeys().makeMap();

body:
  - type: textarea
    id: jobs
    attributes:
      label: Which jobs are failing?
      placeholder: |
        Please only use this template for submitting reports about continuously failing tests or jobs in Kubernetes CI.
    validations:
      required: true

  - type: textarea
    id: tests
    attributes:
      label: Which tests are failing?
    validations:
      required: true

  - type: textarea

        }
        return s1.indexOf(s2) >= 0;
    }

    /**
     * Returns whether two strings are equal. If both are null, returns <code>true</code>.
     *
     * @param target1
     *            the first string
     * @param target2
     *            the second string
     * @return true if the strings are equal, false otherwise
     */
    public static boolean equals(final String target1, final String target2) {

      requireNonNull(connections.removeSuccessor(successor));
      --edgeCount;
    }
    if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
      // Since views are returned, we need to copy the predecessors that will be removed.
      // Thus we avoid modifying the underlying view while iterating over it.

        smbComNtTransaction.dataOffset = 200;

        byte[] dst = new byte[100];
        smbComNtTransaction.writeParameterWordsWireFormat(dst, 0);

        // Check that offsets are zero when counts are zero
        assertEquals(0, SmbComTransaction.readInt4(dst, 23), "parameterOffset should be 0 when parameterCount is 0");