- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 1,081 for cbits (0.13 sec)
-
pkg/registry/core/service/allocator/utils.go
limitations under the License. */ package allocator import ( "math/big" "math/bits" ) // countBits returns the number of set bits in n func countBits(n *big.Int) int { var count int = 0 for _, w := range n.Bits() { count += bits.OnesCount64(uint64(w)) } return count
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 01 15:09:56 UTC 2021 - 816 bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/doc.go
// The SHA3-x (x equals 224, 256, 384, or 512) functions have a security // strength against preimage attacks of x bits. Since they only produce "x" // bits of output, their collision-resistance is only "x/2" bits. // // The SHAKE-256 and -128 functions have a generic security strength of 256 and // 128 bits against all attacks, provided that at least 2x bits of their output // is used. Requesting more than 64 or 32 bytes of output, respectively, does
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 10 16:37:53 UTC 2024 - 3.1K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
_ = x[len(z)-1] // bounds check elimination hint for i := range z { hi, lo := bits.Mul(x[i], y) lo, c := bits.Add(lo, z[i], 0) // We use bits.Add with zero to get an add-with-carry instruction that // absorbs the carry from the previous bits.Add. hi, _ = bits.Add(hi, 0, c) lo, c = bits.Add(lo, carry, 0) hi, _ = bits.Add(hi, 0, c) carry = hi z[i] = lo } return carry }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
src/runtime/mksizeclasses.go
} fmt.Fprintf(w, "\n") fmt.Fprintf(w, "// %-9s %-4s %-12s\n", "alignment", "bits", "min obj size") for bits, size := range minAligns { if size == 0 { break } if bits+1 < len(minAligns) && size == minAligns[bits+1] { continue } fmt.Fprintf(w, "// %9d %4d %12d\n", 1<<bits, bits, size) } fmt.Fprintf(w, "\n") } func maxObjsPerSpan(classes []class) int { most := 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:31:27 UTC 2024 - 9.6K bytes - Viewed (0) -
src/math/cmplx/tan.go
// Multiply mantissa by the digits and extract the upper two digits (hi, lo). z2hi, _ := bits.Mul64(z2, ix) z1hi, z1lo := bits.Mul64(z1, ix) z0lo := z0 * ix lo, c := bits.Add64(z1lo, z2hi, 0) hi, _ := bits.Add64(z0lo, z1hi, c) // Find the magnitude of the fraction. lz := uint(bits.LeadingZeros64(hi)) e := uint64(bias - (lz + 1)) // Clear implicit mantissa bit and shift into place.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 01 03:16:37 UTC 2020 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
/** * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element. * * <p>Returns whether any bits changed as a result of this operation. */ <T extends @Nullable Object> boolean put( @ParametricNullness T object, Funnel<? super T> funnel, int numHashFunctions, LockFreeBitArray bits); /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
src/cmd/compile/internal/ir/mini.go
) func (n *miniNode) Typecheck() uint8 { return n.bits.get2(miniTypecheckShift) } func (n *miniNode) SetTypecheck(x uint8) { if x > 2 { panic(fmt.Sprintf("cannot SetTypecheck %d", x)) } n.bits.set2(miniTypecheckShift, x) } func (n *miniNode) Walked() bool { return n.bits&miniWalked != 0 } func (n *miniNode) SetWalked(x bool) { n.bits.set(miniWalked, x) } // Empty, immutable graph structure.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 31 22:09:44 UTC 2022 - 2.8K bytes - Viewed (0) -
src/math/cbrt.go
x = -x sign = true } // rough cbrt to 5 bits t := Float64frombits(Float64bits(x)/3 + B1<<32) if x < SmallestNormal { // subnormal number t = float64(1 << 54) // set t= 2**54 t *= x t = Float64frombits(Float64bits(t)/3 + B2<<32) } // new cbrt to 23 bits r := t * t / x s := C + r*t t *= G + F/(s+E+D/s) // chop to 22 bits, make larger than cbrt(x)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 2.3K bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/internal/gtest-internal.h
// The mask for the sign bit. static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast<Bits>(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 43.1K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe_generic.go
// license that can be found in the LICENSE file. package field import "math/bits" // uint128 holds a 128-bit number as two 64-bit limbs, for use with the // bits.Mul64 and bits.Add64 intrinsics. type uint128 struct { lo, hi uint64 } // mul64 returns a * b. func mul64(a, b uint64) uint128 { hi, lo := bits.Mul64(a, b) return uint128{lo, hi} } // addMul64 returns v + a * b.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 27 01:16:19 UTC 2023 - 8.5K bytes - Viewed (0)