* with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate
     * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)
     * and then to XOR them together.  The strideTable enables us to hash an int followed by 12
     * zero bytes (3 ints), while the byteTable is for advancing one byte at a time.

  /** Returns a byte string that differs from this one by one bit. */
  private fun ByteString.offByOneBit(): ByteString =
    Buffer()
      .write(this, 0, size - 1)
      .writeByte(this[size - 1].toInt() xor 1)
      .readByteString()

  private fun date(s: String): Date =
    SimpleDateFormat("yyyy-MM-dd'T'HH:mm:ss.SSSZ").run {
      timeZone = TimeZone.getTimeZone("GMT")
      parse(s)
    }

	}
	return v.toPromName(mg.CollectorPath.metricPrefix())
}

func (mg *MetricsGroup) validate() {
	if len(mg.Descriptors) == 0 {
		panic("Descriptors must be set")
	}

	// For bools A and B, A XOR B <=> A != B.
	isExactlyOneSet := (mg.loader == nil) != (mg.bucketLoader == nil)
	if !isExactlyOneSet {
		panic("Exactly one Loader function must be set")
	}

        assertEquals(sampleSize, uniqueCounters.size(), "All nonces should have unique values");

        // Verify that nonces have good entropy (not predictable)
        // With SecureRandom + counter XOR, they should all be different
        Set<String> uniqueNonces = new HashSet<>();
        for (byte[] nonce : nonces) {
            uniqueNonces.add(bytesToHex(nonce));
        }

		Certs:      []madmin.TLSCert{},
	}

	if globalIsTLS {
		for _, c := range globalPublicCerts {
			check := xxh3.Hash(c.RawIssuer)
			check ^= xxh3.Hash(c.RawSubjectPublicKeyInfo)
			// We XOR, so order doesn't matter.
			for _, v := range c.DNSNames {
				check ^= xxh3.HashString(v)
			}
			for _, v := range c.EmailAddresses {
				check ^= xxh3.HashString(v)
			}

/    quotient               integers, floats, complex values
%    remainder              integers

&    bitwise AND            integers
|    bitwise OR             integers
^    bitwise XOR            integers
&^   bit clear (AND NOT)    integers

<<   left shift             integer << integer >= 0
>>   right shift            integer >> integer >= 0
</pre>

pkg go/token, const SUB_ASSIGN Token
pkg go/token, const SWITCH Token
pkg go/token, const TYPE Token
pkg go/token, const UnaryPrec ideal-int
pkg go/token, const VAR Token
pkg go/token, const XOR Token
pkg go/token, const XOR_ASSIGN Token
pkg go/token, func Lookup(string) Token
pkg go/token, func NewFileSet() *FileSet
pkg go/token, method (*File) AddLine(int)

pkg go/token, const SUB = 13
pkg go/token, const SUB_ASSIGN = 24
pkg go/token, const SWITCH = 83
pkg go/token, const TYPE = 84
pkg go/token, const UnaryPrec = 6
pkg go/token, const VAR = 85
pkg go/token, const XOR = 19
pkg go/token, const XOR_ASSIGN = 30
pkg hash/adler32, const Size = 4
pkg hash/crc32, const Castagnoli = 2197175160
pkg hash/crc32, const IEEE = 3988292384
pkg hash/crc32, const Koopman = 3945912366