- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 450 for cbits (0.31 sec)
-
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) -
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) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
LockFreeBitArray bits) { long bitSize = bits.bitSize(); long hash64 = Hashing.murmur3_128().hashObject(object, funnel).asLong(); int hash1 = (int) hash64; int hash2 = (int) (hash64 >>> 32); boolean bitsChanged = false; for (int i = 1; i <= numHashFunctions; i++) { int combinedHash = hash1 + (i * hash2); // Flip all the bits if it's negative (guaranteed positive number)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
tensorflow/c/eager/dlpack.cc
switch (dtype.code) { case DLDataTypeCode::kDLBool: if (dtype.bits != 8) { return tensorflow::errors::InvalidArgument( "Only DLPack bools of bitwidth 8 are supported, got: ", dtype.bits); } *tf_dtype = TF_DataType::TF_BOOL; return absl::OkStatus(); case DLDataTypeCode::kDLUInt: switch (dtype.bits) { case 8: *tf_dtype = TF_DataType::TF_UINT8;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 15 09:49:45 UTC 2024 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
public static HashFunction goodFastHash(int minimumBits) { int bits = checkPositiveAndMakeMultipleOf32(minimumBits); if (bits == 32) { return Murmur3_32HashFunction.GOOD_FAST_HASH_32; } if (bits <= 128) { return Murmur3_128HashFunction.GOOD_FAST_HASH_128; } // Otherwise, join together some 128-bit murmur3s int hashFunctionsNeeded = (bits + 127) / 128;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 29.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/RISCV64Ops.go
{name: "ADDIW", argLength: 1, reg: gp11, asm: "ADDIW", aux: "Int64"}, // 32 low bits of arg0 + auxint, sign extended to 64 bits {name: "NEG", argLength: 1, reg: gp11, asm: "NEG"}, // -arg0 {name: "NEGW", argLength: 1, reg: gp11, asm: "NEGW"}, // -arg0 of 32 bits, sign extended to 64 bits {name: "SUB", argLength: 2, reg: gp21, asm: "SUB"}, // arg0 - arg1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 14:57:07 UTC 2024 - 30.7K bytes - Viewed (0) -
pkg/util/iptree/iptree.go
// in a subnet to 1. // network 192.168.0.0/24 : subnet bits 24 host bits 32 - 24 = 8 // broadcast address 192.168.0.255 func broadcastAddress(subnet netip.Prefix) (netip.Addr, error) { base := subnet.Masked().Addr() bytes := base.AsSlice() // get all the host bits from the subnet n := 8*len(bytes) - subnet.Bits() // set all the host bits to 1
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17.7K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768_test.go
if c >= 1<<bits { t.Fatalf("compress(%d, %d) = %d >= 2^bits", a, bits, c) } got := decompress(c, bits) diff := min(a-got, got-a, a-got+q, got-a+q) ceil := q / (1 << bits) if diff > fieldElement(ceil) { t.Fatalf("decompress(compress(%d, %d), %d) = %d (diff %d, max diff %d)", a, bits, bits, got, diff, ceil) } } } } func CompressRat(x fieldElement, d uint8) uint16 { if x >= q {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
public static HashFunction goodFastHash(int minimumBits) { int bits = checkPositiveAndMakeMultipleOf32(minimumBits); if (bits == 32) { return Murmur3_32HashFunction.GOOD_FAST_HASH_32; } if (bits <= 128) { return Murmur3_128HashFunction.GOOD_FAST_HASH_128; } // Otherwise, join together some 128-bit murmur3s int hashFunctionsNeeded = (bits + 127) / 128;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 32.3K 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)