private static final InternetDomainName UNICODE_EXAMPLE =
      InternetDomainName.from("j\u00f8rpeland.no");
  private static final InternetDomainName PUNYCODE_EXAMPLE =
      InternetDomainName.from("xn--jrpeland-54a.no");

  /** The Greek letter delta, used in unicode testing. */
  private static final String DELTA = "\u0394";

        .Builder()
        .add("σkhttp.com", certA1Sha256Pin)
        .build()

    val expectedPin = listOf(Pin("σkhttp.com", certA1Sha256Pin))
    assertThat(certificatePinner.findMatchingPins("xn--khttp-fde.com")).isEqualTo(expectedPin)
  }

  /** https://github.com/square/okhttp/issues/3324  */
  @Test
  fun checkSubstringMatch() {
    val certificatePinner =
      CertificatePinner

    assertThat(parse("http://abcd").host).isEqualTo("abcd")
    assertThat(parse("http://σ").host).isEqualTo("xn--4xa")
  }

  @Test
  fun hostnameUppercaseCharactersConvertedToLowercase() {
    assertThat(parse("http://ABCD").host).isEqualTo("abcd")
    assertThat(parse("http://Σ").host).isEqualTo("xn--4xa")
  }

  @Test
  fun hostnameIgnoredCharacters() {
    // The soft hyphen (­) should be ignored.

   *
   *  * An encoded IDN, like `xn--n3h.net`.
   *
   * | URL                   | `host()`        |
   * | :-------------------- | :-------------- |
   * | `http://android.com/` | `"android.com"` |
   * | `http://127.0.0.1/`   | `"127.0.0.1"`   |
   * | `http://[::1]/`       | `"::1"`         |
   * | `http://xn--n3h.net/` | `"xn--n3h.net"` |
   */
  @get:JvmName("host") val host: String,
  /**

}

/**
 * If this is an IP address, this returns the IP address in canonical form.
 *
 * Otherwise, this performs IDN ToASCII encoding and canonicalize the result to lowercase. For
 * example this converts `☃.net` to `xn--n3h.net`, and `WwW.GoOgLe.cOm` to `www.google.com`.
 * `null` will be returned if the host cannot be ToASCII encoded or if the result contains
 * unsupported ASCII characters.
 */

7e0]/g,function(e){return Hn[e]})},postformat:function(e){return e.replace(/\d/g,function(e){return Sn[e]})},week:{dow:1,doy:4}});var jn={1:"\u0ce7",2:"\u0ce8",3:"\u0ce9",4:"\u0cea",5:"\u0ceb",6:"\u0cec",7:"\u0ced",8:"\u0cee",9:"\u0cef",0:"\u0ce6"},xn={"\u0ce7":"1","\u0ce8":"2","\u0ce9":"3","\u0cea":"4","\u0ceb":"5","\u0cec":"6","\u0ced":"7","\u0cee":"8","\u0cef":"9","\u0ce6":"0"};M.defineLocale("kn",{months:"\u0c9c\u0ca8\u0cb5\u0cb0\u0cbf_\u0cab\u0cc6\u0cac\u0ccd\u0cb0\u0cb5\u0cb0\u0cbf_\u0cae\...

gro?lim?m&oc?uesum??o&fni?r&ea?p???pooc?t&en?ni??ude?vog?zib???o&g?m??rt?s!.&bog?der?gro?moc?ude???t!.&arukas,bew-eht-no,morf,naht-&esrow,retteb,?sndnyd,?d?i?won??uqhv--nx??w&a!.moc?l??b!.&ca?gro?oc?ten?vog???c!.&gro?moc?ten?ude??cp??e&iver?n?s??g!.xn,?k!.&bme?dni?gro?moc?ten?ude?vog???m!.&ca?gro?moc?oc?pooc?t&en?ni??ude?vog?zib??b??o&csom?h!s??n?w??p!.&344x,snduolc,vog???r!.&ca?gro?lim?oc?pooc?ten?vog??n??t!.&bulc?emag?gro?l&im?ru,?moc!.reliamym,?sndym,ten?ude?v&di?og??zibe???z!.&ca?gro?lim?oc?...

»ËT¹KÛùód¼U Êb‚ A` C–h;\ñ AoOˆ uXosÆ ÏŒJÿÒ á¾Î¦»Ó:ÈV &Va§šÐü}œM@ V¡ï%ú â"Ù š !ùôe³ ço1 ¨d³×äÕpÉÛO Æ+" ߢ©Îùd »1 ‘sÖÀ »‡›Ç\Ì ¬±3 V-{è€Ýîb Ú®>z•·)F+ŸÍ~ÒµjBÍcÝ2I9Fdáû¿¡Ø j.hË ¦Äµ„î ‰šâ0oÇ"(B„öÂôïõQà¡M ¤= l r `ûÇÕW€äqyj U¢ç8®÷ CÏx—é¾ê¸<›sö‡ÊHÉ°;y²š¾ A”f.d€ € XÑ ~Xu@aßêqØ=; ×ÄZ²ƒ©æ¯`¾|¹¼Åíƒ3f”ÁWÆÚ1]Ô¿„¤ƒF–ÿ¸¬©ÊJš½×ê¼è¢27¢Vés /î – ³gD ¡]#6pWYWWö [Y‹šŸc ü; Ü×dg”—s¿f}ñ5 ^ QÈ*¼ú¢CÕÚ´ÀŸo Î?v9X<G PR m ‹¯a;X°d韩Vq45Jª MÔ^ uí§ò` ]i O 9K×µç ù³:Cr3¸ ÂÁ: Øl%€ ¦œûâà ý1tÕYmU¨ à) ÀÅ ±E§ ¸ç°ÉÓôIo *wËÎ ûõ[k *ã°yË ånâ…<ù¬Âµ`²”•...

Thus the length and capacity of a slice literal are the maximum
element index plus one. A slice literal has the form
</p>

<pre>
[]T{x1, x2, … xn}
</pre>

<p>
and is shorthand for a slice operation applied to an array:
</p>

<pre>
tmp := [n]T{x1, x2, … xn}
tmp[0 : n]
</pre>

<p>
Within a composite literal of array, slice, or map type <code>T</code>,

powx[i], p) } p <<= 1 if p&0x100 != 0 { p ^= poly } } } // Multiply b and c as GF(2) polynomials modulo poly func mul(b, c uint32) uint32 { i := b j := c s := uint32(0) for k := uint32(1); k < 0x100 && j != 0; k <<= 1 { // Invariant: k == 1<<n, i == b * xⁿ if j&k != 0 { // s += i in GF(2); xor in binary s ^= i j ^= k // turn off bit to end loop early } // i *= x in GF(2) modulo the polynomial i <<= 1 if i&0x100 != 0 { i ^= poly } } return s } // Test all mul inputs against bit-by-bit n² algorithm. func...