public long writeFrom(InputStream input) throws IOException {
    checkNotNull(input);

    try (OutputStream out = openStream()) {
      return ByteStreams.copy(input, out);
    }
  }

  /**
   * A char sink that encodes written characters with a charset and writes resulting bytes to this
   * byte sink.
   */
  private final class AsCharSink extends CharSink {

    private final Charset charset;

        out.println("</td></tr></table>");
        out.println("</BODY></HTML>");
        out.close();
    }

    private static String parseServerAndShare(final String pathInfo) {
        final char[] out = new char[256];
        char ch;
        int len, p, i;

        if (pathInfo == null) {
            return null;
        }
        len = pathInfo.length();

        p = i = 0;

      checkState(position != startPosition);
      return token;
    }

    char consumeCharacter(CharMatcher matcher) {
      checkState(hasMore());
      char c = previewChar();
      checkState(matcher.matches(c));
      position++;
      return c;
    }

    @CanIgnoreReturnValue
    char consumeCharacter(char c) {
      checkState(hasMore());
      checkState(previewChar() == c);

  @JvmStatic
  fun headerEntries(vararg elements: String?): List<Header> = List(elements.size / 2) { Header(elements[it * 2]!!, elements[it * 2 + 1]!!) }

  @JvmStatic
  fun repeat(
    c: Char,
    count: Int,
  ): String {
    val array = CharArray(count)
    Arrays.fill(array, c)
    return String(array)
  }

  /**

        assertTrue(value == 255, "Comparison should work correctly");
    }

    /**
     * Encode a string as 16-bit little-endian Unicode
     */
    private byte[] encodeUnicode(String s) {
        char[] chars = s.toCharArray();
        byte[] out = new byte[chars.length * 2];
        for (int i = 0; i < chars.length; i++) {
            out[2 * i] = (byte) (chars[i] & 0xFF);

        int codePoint;
        // discard illegal surrogate "codepoints"
        do {
          codePoint = rnd.nextInt(maxCodePoint.value);
        } while (Character.isSurrogate((char) codePoint));
        sb.appendCodePoint(codePoint);
      }
      strings[i] = sb.toString();
    }
  }

  @Benchmark
  int hashUtf8(int reps) {
    int res = 0;

      Deque<CharSequence> stack,
      CharSequence encoded,
      int start,
      ImmutableMap.Builder<String, PublicSuffixType> builder) {

    int encodedLen = encoded.length();
    int idx = start;
    char c = '\0';

    // Read all the characters for this node.
    for (; idx < encodedLen; idx++) {
      c = encoded.charAt(idx);

      if (c == '&' || c == '?' || c == '!' || c == ':' || c == ',') {
        break;

            if (targetUrl.indexOf('#') == -1) {
                final StringBuilder buf = new StringBuilder(value.length() + 100);
                for (final char c : value.toCharArray()) {
                    if (CharUtil.isUrlChar(c) || c == ' ') {
                        buf.append(c);
                    } else {
                        try {

        out.println("</td></tr></table>");
        out.println("</BODY></HTML>");
        out.close();
    }

    private String parseServerAndShare(final String pathInfo) {
        final char[] out = new char[256];
        char ch;
        int len, p, i;

        if (pathInfo == null) {
            return null;
        }
        len = pathInfo.length();

        p = i = 0;

        radix);
    if (x == 0) {
      // Simply return "0"
      return "0";
    } else if (x > 0) {
      return Long.toString(x, radix);
    } else {
      char[] buf = new char[64];
      int i = buf.length;
      if ((radix & (radix - 1)) == 0) {
        // Radix is a power of two so we can avoid division.
        int shift = Integer.numberOfTrailingZeros(radix);