- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 1,081 for cbits (0.08 sec)
-
src/math/trig_reduce.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) // The top 3 bits are j. j = hi >> 61 // Extract the fraction and find its magnitude. hi = hi<<3 | lo>>61 lz := uint(bits.LeadingZeros64(hi)) e := uint64(bias - (lz + 1))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/hashes.go
"hash" ) // New224 creates a new SHA3-224 hash. // Its generic security strength is 224 bits against preimage attacks, // and 112 bits against collision attacks. func New224() hash.Hash { return new224() } // New256 creates a new SHA3-256 hash. // Its generic security strength is 256 bits against preimage attacks, // and 128 bits against collision attacks. func New256() hash.Hash { return new256() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 2.7K bytes - Viewed (0) -
src/crypto/internal/bigmod/_asm/nat_amd64_asm.go
Package("crypto/internal/bigmod") ConstraintExpr("!purego") addMulVVW(1024) addMulVVW(1536) addMulVVW(2048) Generate() } func addMulVVW(bits int) { if bits%64 != 0 { panic("bit size unsupported") } Implement("addMulVVW" + strconv.Itoa(bits)) CMPB(Mem{Symbol: Symbol{Name: "·supportADX"}, Base: StaticBase}, Imm(1)) JEQ(LabelRef("adx")) z := Mem{Base: Load(Param("z"), GP64())}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 22:37:58 UTC 2023 - 2.5K bytes - Viewed (0) -
src/cmd/internal/obj/s390x/rotate.go
if mask == 0 { return nil } // normalize the mask so that the set bits are left aligned o := bits.LeadingZeros64(^mask) mask = bits.RotateLeft64(mask, o) z := bits.LeadingZeros64(mask) mask = bits.RotateLeft64(mask, z) // check that the normalized mask is contiguous l := bits.LeadingZeros64(^mask) if l+bits.TrailingZeros64(mask) != 64 { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 21 19:19:04 UTC 2020 - 3.6K bytes - Viewed (0) -
src/internal/zstd/fse.go
nextState := next[sym] next[sym]++ if nextState == 0 { return r.makeError(off, "FSE state error") } highBit := 15 - bits.LeadingZeros16(nextState) bits := tableBits - highBit table[i].bits = uint8(bits) table[i].base = (nextState << bits) - uint16(tableSize) } return nil } // fseBaselineEntry is an entry in an FSE baseline table.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 17 16:44:06 UTC 2023 - 12.2K bytes - Viewed (0) -
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 - 26.3K bytes - Viewed (0) -
test/float_lit2.go
} for _, c := range cvt { if bits(c.exact) != c.bits { bug() fmt.Printf("%s: inconsistent table: bits=%#x (%g) but exact=%g (%#x)\n", c.text, c.bits, fromBits(c.bits, c.exact), c.exact, bits(c.exact)) } if c.approx != c.exact || bits(c.approx) != c.bits { bug() fmt.Printf("%s: have %g (%#x) want %g (%#x)\n", c.text, c.approx, bits(c.approx), c.exact, c.bits) } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 14 16:39:47 UTC 2016 - 7.9K bytes - Viewed (0) -
src/internal/zstd/xxhash.go
// digest returns the final hash value. func (xh *xxhash64) digest() uint64 { var h64 uint64 if xh.len < 32 { h64 = xh.v[2] + xxhPrime64c5 } else { h64 = bits.RotateLeft64(xh.v[0], 1) + bits.RotateLeft64(xh.v[1], 7) + bits.RotateLeft64(xh.v[2], 12) + bits.RotateLeft64(xh.v[3], 18) h64 = xh.mergeRound(h64, xh.v[0]) h64 = xh.mergeRound(h64, xh.v[1]) h64 = xh.mergeRound(h64, xh.v[2]) h64 = xh.mergeRound(h64, xh.v[3])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:34:13 UTC 2023 - 3.3K bytes - Viewed (0) -
src/runtime/gc_test.go
// n must always be a multiple of 8, since gcBits is // always rounded up 8 bytes. for _, n := range []int{8, 16, 32, 64, 128} { b.Run(fmt.Sprintf("bits=%d", n*8), func(b *testing.B) { // Initialize a new byte slice with pseduo-random data. bits := make([]byte, n) rand.Read(bits) b.ResetTimer() for i := 0; i < b.N; i++ { runtime.MSpanCountAlloc(s, bits) } }) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 05 22:33:52 UTC 2024 - 17.6K bytes - Viewed (0) -
test/codegen/rotate.go
a[2] = a[1] & bits.RotateLeft64(a[0], 13) // arm64: "ORR\tR[0-9]+@>51, R[0-9]+, R[0-9]+" a[5] = a[4] | bits.RotateLeft64(a[3], 13) // arm64: "EOR\tR[0-9]+@>51, R[0-9]+, R[0-9]+" a[8] = a[7] ^ bits.RotateLeft64(a[6], 13) // arm64: "MVN\tR[0-9]+@>51, R[0-9]+" a[10] = ^bits.RotateLeft64(a[9], 13) // arm64: "BIC\tR[0-9]+@>51, R[0-9]+, R[0-9]+" a[13] = a[12] &^ bits.RotateLeft64(a[11], 13)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 14:57:07 UTC 2024 - 6K bytes - Viewed (0)