const github.com/gotd/td/bin.Word

26 uses

	github.com/gotd/td/bin (current package)
		bin.go#L26: const Word = 4
		bin.go#L29: 	n := Word * (l / Word)
		bin.go#L31: 		n += Word
		decode.go#L11: 	if len(b.Buf) < Word {
		decode.go#L41: 	b.Buf = b.Buf[Word:]
		decode.go#L47: 	const size = Word * 2
		decode.go#L85: 		b.Buf = b.Buf[Word:]
		decode.go#L88: 		b.Buf = b.Buf[Word:]
		decode.go#L106: 	b.Buf = b.Buf[Word:]
		encode.go#L67: 	t := make([]byte, Word)
		encode.go#L84: 	t := make([]byte, Word*2)

	github.com/gotd/td/internal/crypto
		rand.go#L23: 	var buf [bin.Word * 2]byte
		rand.go#L35: 	var buf [bin.Word * 4]byte
		rand.go#L47: 	var buf [bin.Word * 8]byte

	github.com/gotd/td/internal/proto/codec
		abridged.go#L120: 	b.ResetN(bin.Word)
		codec.go#L33: 	b.ResetN(bin.Word)
		codec.go#L34: 	if _, err := io.ReadFull(r, b.Buf[:bin.Word]); err != nil {
		codec.go#L37: 	n := int(binary.LittleEndian.Uint32(b.Buf[:bin.Word]))
		errors.go#L68: 	if b.Len() != bin.Word {
		full.go#L85: 	b.Expand(n - bin.Word)
		full.go#L86: 	inner := &bin.Buffer{Buf: b.Buf[bin.Word:n]}
		full.go#L102: 	payloadLength := n - 3*bin.Word
		full.go#L112: 	clientCRC := crc32.ChecksumIEEE(b.Buf[0 : n-bin.Word])
		full.go#L121: 	copy(b.Buf, b.Buf[2*bin.Word:n-bin.Word])