}

  public void testShort() {
    Sink sink = new Sink(4);
    sink.putShort((short) 0x0201);
    HashCode unused = sink.hash();
    sink.assertInvariants(2);
    sink.assertBytes(new byte[] {1, 2, 0, 0}); // padded with zeros
  }

  public void testInt() {
    Sink sink = new Sink(4);
    sink.putInt(0x04030201);
    HashCode unused = sink.hash();
    sink.assertInvariants(4);
    sink.assertBytes(new byte[] {1, 2, 3, 4});

	// This matches most other JSON generators.
	// See golang.org/issue/6384 and golang.org/issue/14135.
	// Like fmt %g, but the exponent cutoffs are different
	// and exponents themselves are not padded to two digits.
	abs := math.Abs(f)
	fmt := byte('f')
	if abs != 0 {
		if abs < 1e-6 || abs >= 1e21 {
			fmt = 'e'
		}
	}
	dst = strconv.AppendFloat(dst, f, fmt, -1, 64)
	if fmt == 'e' {

            final ByteBuffer buffer = ByteBuffer.wrap(nonce);
            buffer.order(java.nio.ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(counter);
            // Remaining bytes (if any) stay zero-padded
        }

        return nonce;
    }

    /**
     * Generate a secure random nonce for initial session setup.
     * This method can be used when enhanced randomness is required,

	f.err = ErrFieldTooLong
}

func (p *parser) parseOctal(b []byte) int64 {
	// Because unused fields are filled with NULs, we need
	// to skip leading NULs. Fields may also be padded with
	// spaces or NULs.
	// So we remove leading and trailing NULs and spaces to
	// be sure.
	b = bytes.Trim(b, " \x00")

	if len(b) == 0 {
		return 0
	}

                setNetbiosName(ctx.getNetbiosName());
                byte[] sk = ctx.getSigningKey();
                if (sk != null) {
                    // session key is truncated to 16 bytes, right padded with 0 if shorter
                    byte[] key = new byte[16];
                    System.arraycopy(sk, 0, key, 0, Math.min(16, sk.length));
                    this.sessionKey = key;
                }

roved() var out [gcmBlockSize]byte ghash(&out, key, inputs...) return out[:] } // ghash is a variable-time generic implementation of GHASH, which shouldn't // be used on any architecture with hardware support for AES-GCM. // // Each input is zero-padded to 128-bit before being absorbed. func ghash(out, H *[gcmBlockSize]byte, inputs ...[]byte) { // productTable contains the first sixteen powers of the key, H. // However, they are in bit reversed order. var productTable [16]gcmFieldElement // We precompute...

roved() var out [gcmBlockSize]byte ghash(&out, key, inputs...) return out[:] } // ghash is a variable-time generic implementation of GHASH, which shouldn't // be used on any architecture with hardware support for AES-GCM. // // Each input is zero-padded to 128-bit before being absorbed. func ghash(out, H *[gcmBlockSize]byte, inputs ...[]byte) { // productTable contains the first sixteen powers of the key, H. // However, they are in bit reversed order. var productTable [16]gcmFieldElement // We precompute...