// file, You can obtain one at https://mozilla.org/MPL/2.0/.

// Please pull this list from, and only from https://publicsuffix.org/list/public_suffix_list.dat,
// rather than any other VCS sites. Pulling from any other URL is not guaranteed to be supported.

// Instructions on pulling and using this list can be found at https://publicsuffix.org/list/.

// ===BEGIN ICANN DOMAINS===

// ac : http://nic.ac/rules.htm
ac
com.ac
edu.ac

    assertContent("DEF", getResponse(newRequest("/")))
    assertContent("GHI", getResponse(newRequest("/")))
    assertThat(hostnameVerifier.calls)
      .isEqualTo(listOf("verify " + server.hostName))
    assertThat(trustManager.calls)
      .isEqualTo(listOf("checkServerTrusted [CN=localhost 1]"))
  }

  @Test
  fun getClientRequestTimeout() {
    enqueueClientRequestTimeoutResponses()

      LocalCache<Object, Object> map = makeLocalCache(builder.concurrencyLevel(1));
      Segment<Object, Object> segment = map.segments[0];
      List<ReferenceEntry<Object, Object>> writeOrder = Lists.newLinkedList();
      List<ReferenceEntry<Object, Object>> readOrder = Lists.newLinkedList();
      for (int i = 0; i < SMALL_MAX_SIZE; i++) {
        Object key = new Object();
        int hash = map.hash(key);

      LocalCache<Object, Object> map = makeLocalCache(builder.concurrencyLevel(1));
      Segment<Object, Object> segment = map.segments[0];
      List<ReferenceEntry<Object, Object>> writeOrder = Lists.newLinkedList();
      List<ReferenceEntry<Object, Object>> readOrder = Lists.newLinkedList();
      for (int i = 0; i < SMALL_MAX_SIZE; i++) {
        Object key = new Object();
        int hash = map.hash(key);

MultipleArtifactsNot extends ArtifactResolutionEx { private final java.util.List resolvedArtifacts; private final java.util.List missingArtifacts; public void MultipleArtifactsNot(org.apache.maven.artifact.Artifact, java.util.List, java.util.List); public void MultipleArtifactsNot(org.apache.maven.artifact.Artifact, java.util.List, java.util.List, java.util.List); public java.util.List getResolvedArtifacts(); public java.util.List getMissingArtifacts(); private static String constructMessage(java.util.List);...

implements Cloneable, java.io.Serializable { private String label; java.util.List children; java.util.List parents; public void Vertex(String); public String getLabel(); public void addEdgeTo(Vertex); public void removeEdgeTo(Vertex); public void addEdgeFrom(Vertex); public void removeEdgeFrom(Vertex); public java.util.List getChildren(); public java.util.List getChildLabels(); public java.util.List getParents(); public java.util.List getParentLabels(); public boolean isLeaf(); public boolean isRoot(); public...

    override val type: KtClassLikeSymbol,
    override val bounds: List<KtType>,
    firDiagnostic: KtPsiDiagnostic,
    token: KtLifetimeToken,
) : KtAbstractFirDiagnostic<PsiElement>(firDiagnostic, token), KtFirDiagnostic.InconsistentTypeParameterBounds

internal class AmbiguousSuperImpl(
    override val candidates: List<KtType>,
    firDiagnostic: KtPsiDiagnostic,
    token: KtLifetimeToken,

CycleDetectedExcepti extends Exception { private java.util.List cycle; public void CycleDetectedExcepti(String, java.util.List); public java.util.List getCycle(); public String cycleToString(); public String getMessage(); } org/codehaus/plexus/util/dag/Vertex.class package org.codehaus.plexus.util.dag; public synchronized class Vertex implements Cloneable, java.io.Serializable { private String label; java.util.List children; java.util.List parents; public void Vertex(String); public String getLabel();...

          // Single node on list
          if (next == null) {
            newTable.set(headIndex, head);
          } else {
            // Reuse the consecutive sequence of nodes with the same target
            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            ReferenceEntry<K, V> tail = head;

          // Single node on list
          if (next == null) {
            newTable.set(headIndex, head);
          } else {
            // Reuse the consecutive sequence of nodes with the same target
            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            ReferenceEntry<K, V> tail = head;