pkg image/color, type NYCbCrA struct, embedded YCbCr
pkg image/color, var NYCbCrAModel Model
pkg math/big, method (*Float) MarshalText() ([]uint8, error)
pkg math/big, method (*Float) UnmarshalText([]uint8) error
pkg math/big, method (*Int) Append([]uint8, int) []uint8
pkg math/big, method (*Int) Text(int) string
pkg math/rand, func Read([]uint8) (int, error)
pkg math/rand, method (*Rand) Read([]uint8) (int, error)

   *
   * @deprecated Use {@link StandardCharsets#UTF_8} instead.
   */
  @Deprecated public static final Charset UTF_8 = StandardCharsets.UTF_8;

  /**
   * UTF-16BE: sixteen-bit UCS Transformation Format, big-endian byte order.
   *
   * @deprecated Use {@link StandardCharsets#UTF_16BE} instead.
   */
  @Deprecated @J2ktIncompatible @GwtIncompatible // Charset not supported by GWT

# Sourcing this enables local disk cache
if [[ $(uname -s) == "Darwin" ]]; then
  echo "Please note that using disk cache on macOS is not recommended because the"
  echo "cache can end up being pretty big and make the build process inefficient."
fi

    font-size: 10pt
}
body {
    font-family: Verdana, sans-serif;
    font-size: 10pt;
    background-color: #ffffff;
    margin-top: 0;
    margin-left: 5
}
small {
    font-size: 8pt
}
big {
    font-size: 14pt

        path = dir.getCanonicalPath();

        if (path.length() < 7) {
            out.println("<b><big>smb1://</big></b><br>");
            path = ".";
        } else {
            out.println("<b><big>" + path + "</big></b><br>");
            path = "../";
        }
        out.println(dirCount + fileCount + " objects (" + dirCount + " directories, " + fileCount + " files)<br>");

        // The hardware is big-endian, so we need to reverse the order of the bytes.
        return Long.reverseBytes(bigEndian);
      }

      @Override
      public void putLongLittleEndian(byte[] array, int offset, long value) {
        // Reverse the order of the bytes before storing, since we're on big-endian hardware.
        long littleEndianValue = Long.reverseBytes(value);

        // TOK_ID
        buf[i++] = tokId[0];
        buf[i++] = tokId[1];
        // MECH_OID_LEN (2 bytes big-endian)
        buf[i++] = (byte) ((oidLen >>> 8) & 0xFF);
        buf[i++] = (byte) (oidLen & 0xFF);
        // MECH_OID
        System.arraycopy(oidDer, 0, buf, i, oidLen);
        i += oidLen;
        // NAME_LEN (4 bytes big-endian)
        buf[i++] = (byte) ((nameLen >>> 24) & 0xFF);

    assertEquals(expected, murmur3_128(seed).hashBytes(input));
    assertEquals(expected, murmur3_128(seed).newHasher().putBytes(input).hash());
  }

  /** Returns a {@link HashCode} for a sequence of longs, in big-endian order. */
  private static HashCode toHashCode(long... longs) {
    ByteBuffer bb = ByteBuffer.wrap(new byte[longs.length * 8]).order(ByteOrder.LITTLE_ENDIAN);
    for (long x : longs) {
      bb.putLong(x);
    }

	{"3*(2+3)", 3 * (2 + 3), true},
	{"3*-(2+3)", 3 * -(2 + 3), true},
	{"3<<2+4", 3<<2 + 4, true},
	{"3<<2+4", 3<<2 + 4, true},
	{"3<<(2+4)", 3 << (2 + 4), true},
	// Junk at EOF.
	{"3 x", 3, false},
	// Big number
	{"4611686018427387904", 4611686018427387904, true},
}

func TestExpr(t *testing.T) {
	p := NewParser(nil, nil, nil) // Expression evaluation uses none of these fields of the parser.
	for i, test := range exprTests {

  // trivial because the divisor is bigger than the dividend.
  // Using remainder here does not give us a uniform distribution but it should
  // not have a big impact on the measurement.
  private static long randomDivisor(long dividend) {
    long r = randomSource.nextLong();
    if (dividend == -1) {
      return r;
    } else {