Lines Matching refs:cur
51 // cur is the bit buffer that has not been fed into n.
52 // cbits is the number of low order bits in cur that are valid.
54 cur, cbits, sbits := uint(0), uint8(0), uint8(0)
56 cur = cur<<8 | uint(b)
60 idx := byte(cur >> (cbits - 8))
79 n = n.children[byte(cur<<(8-cbits))]
99 if mask := uint(1<<cbits - 1); cur&mask != mask {
132 cur := rootHuffmanNode
136 if cur.children[i] == nil {
137 cur.children[i] = newInternalNode()
139 cur = cur.children[i]
144 cur.children[i] = &node{sym: sym, codeLen: codeLen}
