/**
   * If a hostname is not a key in the EXCLUDE map, and if removing its leftmost component results
   * in a name which is a key in this map, it is a public suffix.
   */
  public static final ImmutableMap<String, PublicSuffixType> UNDER =
      TrieParser.parseTrie(

  /**
   * If a hostname is not a key in the EXCLUDE map, and if removing its leftmost component results
   * in a name which is a key in this map, it is a public suffix.
   */
  public static final ImmutableMap<String, PublicSuffixType> UNDER =
      TrieParser.parseTrie(

  private fun certificateSANs(peerCertificate: X509Certificate): List<String> {
    return when (val subjectAlternativeNames = peerCertificate.subjectAlternativeNames) {
      null -> listOf()
      else -> subjectAlternativeNames.map { c: List<*> -> c[1] as String }
    }
  }

  @Test fun replacementCharacter() {
    // $ cat ./cert.cnf
    // [req]
    // distinguished_name=distinguished_name
    // req_extensions=req_extensions

				"application/davmount+xml",
				"application/dca-rft",
				"application/dec-dx",
				"application/dialog-info+xml",
				"application/dicom",
				"application/dita+xml",
				"application/dita+xml;format=map",
				"application/dita+xml;format=topic",
				"application/dita+xml;format=task",
				"application/dita+xml;format=concept",
				"application/dita+xml;format=val",
				"application/dns",
				"application/dvcs",

			peersLogOnceIf(logger.SetReqInfo(ctx, reqInfo), nErr.Err, nErr.Host.String())
		}
	}

	replicationStatsList := globalReplicationStats.Load().GetAll()
	bucketStatsMap := BucketStatsMap{
		Stats:     make(map[string]BucketStats, len(replicationStatsList)),
		Timestamp: UTCNow(),
	}
	for k, replicationStats := range replicationStatsList {
		bucketStatsMap.Stats[k] = BucketStats{
			ReplicationStats: replicationStats,

func (p *poolMeta) validate(pools []*erasureSets) (bool, error) {
	type poolInfo struct {
		position     int
		completed    bool
		decomStarted bool // started but not finished yet
	}

	rememberedPools := make(map[string]poolInfo)
	for idx, pool := range p.Pools {
		complete := false
		decomStarted := false
		if pool.Decommission != nil {
			if pool.Decommission.Complete {
				complete = true
			}

   * Entry instances that are either live "read-through" views to the Multiset, or immutable
   * snapshots. Note that this type is unrelated to the similarly-named type {@code Map.Entry}.
   *
   * @since 2.0
   */
  interface Entry<E extends @Nullable Object> {

    /**
     * Returns the multiset element corresponding to this entry. Multiple calls to this method

   *       detected, sacrificing the compactness guarantee in very rare cases in exchange for much
   *       more reliable worst-case behavior.
   *   <li>null, if no entries have yet been added to the map
   * </ul>
   */
  @CheckForNull private transient Object table;

  /**
   * Contains the logical entries, in the range of [0, size()). The high bits of each int are the

llElement.window?"offset":ne,n="auto"===this._config.method?e:this._config.method,i=n===ne?this._getScrollTop():0;this._offsets=[],this._targets=[],this._scrollHeight=this._getScrollHeight(),[].slice.call(document.querySelectorAll(this._selector)).map((function(t){var e,a=d.getSelectorFromElement(t);if(a&&(e=document.querySelector(a)),e){var s=e.getBoundingClientRect();if(s.width||s.height)return[o.default(e)[n]().top+i,a]}return null})).filter(Boolean).sort((function(t,e){return t[0]-e[0]})).fo...

		if cr.debug {
			fmt.Printf("signature, want: %q, got %q\nSignature buffer: %q\n", wantSig, string(sig), valueBuffer.String())
		}
		return errSignatureMismatch
	}

	// Parse trailers.
	wantTrailers := make(map[string]struct{}, len(cr.trailers))
	for k := range cr.trailers {
		wantTrailers[strings.ToLower(k)] = struct{}{}
	}
	input := bufio.NewScanner(bytes.NewReader(valueBuffer.Bytes()))
	for input.Scan() {