Lines Matching defs:bit
654 // x & -x leaves only the right-most bit set in the word. Let k be the
655 // index of that bit. Since only a single bit is set, the value is two
658 // such that all six bit, consecutive substrings are distinct.
660 // find by how many bits it was shifted by looking at which six bit
744 panic("set bit is not 0 or 1")
747 // bit returns the value of the i'th bit, with lsb == bit 0.
748 func (x nat) bit(i uint) uint {
757 // sticky returns 1 if there's a 1 bit within the
864 // possible. n is the bit length of limit.
933 // 4-bit, windowed exponentiation. This involves precomputing 14 values
935 // third. Even for a 32-bit exponent, this reduces the number of
952 // see a bit, we square, thus doubling the power. If the bit is a one,
1000 // expNNWindowed calculates x**y mod m using a fixed, 4-bit window.
1063 // expNNMontgomery calculates x**y mod m using a fixed, 4-bit window.
