0000060 00 08 00 08 03 64 3c f9 f4 89 64 48 01 00 00 b8
0000070 01 00 00 07 00 00 00 72 2f 72 2e 7a 69 70 00 2f
0000080 00 d0 ff c2 54 8e 57 39 00 05 00 fa ff c2 54 8e
0000090 57 39 00 05 00 fa ff 00 05 00 fa ff 00 14 00 eb
00000a0 ff c2 54 8e 57 39 00 05 00 fa ff 00 05 00 fa ff
00000b0 00 14 00 eb ff 42 88 21 c4 00 00 14 00 eb ff 42
00000c0 88 21 c4 00 00 14 00 eb ff 42 88 21 c4 00 00 14

http://example.com/foo%2zbar  s:http h:example.com p:/foo%2zbar
http://example.com/foo%2\u00C2\u00A9zbar  s:http h:example.com p:/foo%2%C3%82%C2%A9zbar
http://example.com/foo%41%7a  s:http h:example.com p:/foo%41%7a
http://example.com/foo\t\u0091%91  s:http h:example.com p:/foo%C2%91%91
http://example.com/foo%00%51  s:http h:example.com p:/foo%00%51
http://example.com/(%28:%3A%29)  s:http h:example.com p:/(%28:%3A%29)

        // However, the folder can be arbitrarily nest so, a == a1/a2/a3, and the test name can include forward slashes, so c == c1/c2/c3
        // So we also need to support a1/a2/a3/b/c1/c2/c3

        String[] testParts = fullTestName.split("/");
        if(testParts.length < 3 ){

      char c1 = s1.charAt(i);
      char c2 = s2.charAt(i);
      if (c1 == c2) {
        continue;
      }
      int alphaIndex = getAlphaIndex(c1);
      // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
      // however this showed no obvious improvement.
      if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
        continue;
      }
      return false;

 *   <li>Ranges are <i>convex</i>: whenever two values are contained, all values in between them
 *       must also be contained. More formally, for any {@code c1 <= c2 <= c3} of type {@code C},
 *       {@code r.contains(c1) && r.contains(c3)} implies {@code r.contains(c2)}). This means that a
 *       {@code Range<Integer>} can never be used to represent, say, "all <i>prime</i> numbers from
 *       1 to 100."

    assertThat(formEncode(125)).isEqualTo("%7D")
    assertThat(formEncode(126)).isEqualTo("%7E")
    assertThat(formEncode(127)).isEqualTo("%7F")
    assertThat(formEncode(128)).isEqualTo("%C2%80")
    assertThat(formEncode(255)).isEqualTo("%C3%BF")
  }

  @Throws(IOException::class)
  private fun formEncode(codePoint: Int): String {

  }

  @Test
  fun fragmentPercentEncodedNonAscii() {
    val url = parse("http://host/#%C2%80")
    assertThat(url.toString()).isEqualTo("http://host/#%C2%80")
    assertThat(url.fragment).isEqualTo("\u0080")
    assertThat(url.encodedFragment).isEqualTo("%C2%80")
  }

  @Test
  fun fragmentPercentEncodedPartialCodePoint() {
    val url = parse("http://host/#%80")

	c1 := Company{Name: "Electronics"}
	c2 := Company{Name: "Books"}
	if err := DB.Create(&c1).Error; err != nil {
		t.Fatalf("create c1: %v", err)
	}
	if err := DB.Create(&c2).Error; err != nil {
		t.Fatalf("create c2: %v", err)
	}

	// Create users with companies
	u1 := User{Name: "John", Age: 25, CompanyID: &c1.ID}
	u2 := User{Name: "Jane", Age: 30, CompanyID: &c2.ID}
	if err := DB.Create(&u1).Error; err != nil {

    FluentIterable<String> tail = FluentIterable.from(list).skip(1);
    Iterator<String> tailIterator = tail.iterator();
    list.set(2, "c2");
    assertThat(tailIterator.next()).isEqualTo("b");
    assertThat(tailIterator.next()).isEqualTo("c2");
    assertFalse(tailIterator.hasNext());
  }

  public void testSkip_structurallyModifiedSkipSome() throws Exception {

 *   <li>Ranges are <i>convex</i>: whenever two values are contained, all values in between them
 *       must also be contained. More formally, for any {@code c1 <= c2 <= c3} of type {@code C},
 *       {@code r.contains(c1) && r.contains(c3)} implies {@code r.contains(c2)}). This means that a
 *       {@code Range<Integer>} can never be used to represent, say, "all <i>prime</i> numbers from
 *       1 to 100."