.containsExactly("a", "\uD83C\uDF69", "c")
    assertThat(parse("http://host/a/%62/c").pathSegments)
      .containsExactly("a", "b", "c")
    assertThat(parse("http://host/a/%7A/c").pathSegments)
      .containsExactly("a", "z", "c")
    assertThat(parse("http://host/a/%7a/c").pathSegments)
      .containsExactly("a", "z", "c")
  }

  @Test

  /** Sets bits in {@code table} matched by this matcher. */
  @GwtIncompatible // used only from other GwtIncompatible code
  void setBits(BitSet table) {
    for (int c = Character.MAX_VALUE; c >= Character.MIN_VALUE; c--) {
      if (matches((char) c)) {
        table.set(c);
      }
    }
  }

  // Text processing routines

  /**

	// Shallow copy
	c := *j
	// Zero fields that will vary across disks
	c.ErasureIndex = 0

	// Nil 0 size allownil, so we don't differentiate between nil and 0 len.
	allEmpty := true
	for _, tag := range c.PartETags {
		if len(tag) != 0 {
			allEmpty = false
			break
		}
	}
	if allEmpty {
		c.PartETags = nil
	}
	if len(c.PartActualSizes) == 0 {
		c.PartActualSizes = nil

          "ａ=>a", "ｂ=>b","ｃ=>c","ｄ=>d","ｅ=>e","ｆ=>f","ｇ=>g","ｈ=>h","ｉ=>i","ｊ=>j","ｋ=>k","ｌ=>l","ｍ=>m","ｎ=>n","ｏ=>o","ｐ=>p","ｑ=>q","ｒ=>r","ｓ=>s",
          "ｔ=>t","ｕ=>u","ｖ=>v","ｗ=>w","ｘ=>x", "ｙ=>y", "ｚ=>z",
          "Ａ=>A", "Ｂ=>B","Ｃ=>C","Ｄ=>D","Ｅ=>E","Ｆ=>F","Ｇ=>g","Ｈ=>H","Ｉ=>I","Ｊ=>j","Ｋ=>k","Ｌ=>L","Ｍ=>M","Ｎ=>N","Ｏ=>O","Ｐ=>P","Ｑ=>Q","Ｒ=>R","Ｓ=>S",

          "ａ=>a", "ｂ=>b","ｃ=>c","ｄ=>d","ｅ=>e","ｆ=>f","ｇ=>g","ｈ=>h","ｉ=>i","ｊ=>j","ｋ=>k","ｌ=>l","ｍ=>m","ｎ=>n","ｏ=>o","ｐ=>p","ｑ=>q","ｒ=>r","ｓ=>s",
          "ｔ=>t","ｕ=>u","ｖ=>v","ｗ=>w","ｘ=>x", "ｙ=>y", "ｚ=>z",
          "Ａ=>A", "Ｂ=>B","Ｃ=>C","Ｄ=>D","Ｅ=>E","Ｆ=>F","Ｇ=>g","Ｈ=>H","Ｉ=>I","Ｊ=>j","Ｋ=>k","Ｌ=>L","Ｍ=>M","Ｎ=>N","Ｏ=>O","Ｐ=>P","Ｑ=>Q","Ｒ=>R","Ｓ=>S",

                  @Override
                  public boolean removeAll(Collection<?> c) {
                    return Iterators.removeAll(iterator(), c);
                  }

                  @Override
                  public boolean retainAll(Collection<?> c) {
                    return Iterators.retainAll(iterator(), c);
                  }
                };
              }
            })

l?ro??hk?i&stvinrehc?ykstyn&lemhk?vypork???k&c?m?s&na&gul?hul??t&enod?ul??v&iknarf-onavi?orteporp&end?ind?????l&iponret?opotsa&bes?ves??p??m&k?oc?s?yrk??n&c?d?i?osrehk?v?ylov??o&c,nvor??p&d?p,z??r&c?imotihz?k?ymotyhz??sk?t&en?l?z??ude?v:c?e&alokin?ik??i&alokym?hinrehc?krahk?vl?yk??k?l?o&g!inrehc??krahk??r?,xc,y&ikstinlemhk?mus?s&akrehc?sakrehc?tvonrehc???z&ib,u????v!aj?bb?et?iv??waniko?x&a?iacal??yogan?z&.&bew?c&a?i&n?rga???gro?l&im?oohcs??m&on?t??o&c?gn??radnorg?sin?t&en?la??ude?vog?wal??zip!.k...

urn ce.css(e,t,"")},u=s(),l=n&&n[3]||(ce.cssNumber[t]?"":"px"),c=e.nodeType&&(ce.cssNumber[t]||"px"!==l&&+u)&&Y.exec(ce.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)ce.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,ce.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ne={};function re(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=_.get(r,"disp...

     *
     * @param <E> the element type of {@link ArrayDeque}
     * @param c the collection of elements to be placed in the deque
     * @return a new instance of {@link ArrayDeque}
     * @see ArrayDeque#ArrayDeque(Collection)
     */
    public static <E> ArrayDeque<E> newArrayDeque(final Collection<? extends E> c) {
        return new ArrayDeque<>(c);
    }

    /**

    assertThat(cache.size()).isEqualTo(10)

    // Cause the size to grow to 12 should evict 'A'.
    set("c", "c", "c")
    cache.flush()
    assertThat(cache.size()).isEqualTo(8)
    assertAbsent("a")
    assertValue("b", "bb", "bbbb")
    assertValue("c", "c", "c")

    // Causing the size to grow to 10 should evict nothing.
    set("d", "d", "d")
    cache.flush()