- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 2,740 for bkts (0.08 sec)
-
src/cmd/vendor/golang.org/x/sys/unix/fdset.go
// Set adds fd to the set fds. func (fds *FdSet) Set(fd int) { fds.Bits[fd/NFDBITS] |= (1 << (uintptr(fd) % NFDBITS)) } // Clear removes fd from the set fds. func (fds *FdSet) Clear(fd int) { fds.Bits[fd/NFDBITS] &^= (1 << (uintptr(fd) % NFDBITS)) } // IsSet returns whether fd is in the set fds. func (fds *FdSet) IsSet(fd int) bool { return fds.Bits[fd/NFDBITS]&(1<<(uintptr(fd)%NFDBITS)) != 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 781 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/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/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) -
src/io/fs/fs.go
// to another portably. Not all bits apply to all systems. // The only required bit is [ModeDir] for directories. type FileMode uint32 // The defined file mode bits are the most significant bits of the [FileMode]. // The nine least-significant bits are the standard Unix rwxrwxrwx permissions. // The values of these bits should be considered part of the public API and // may be used in wire protocols or disk representations: they must not be
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 15 21:21:41 UTC 2024 - 9.4K 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) -
src/math/rand/v2/pcg.go
// state = state * mul + inc hi, lo = bits.Mul64(p.lo, mulLo) hi += p.hi*mulLo + p.lo*mulHi lo, c := bits.Add64(lo, incLo, 0) hi, _ = bits.Add64(hi, incHi, c) p.lo = lo p.hi = hi return hi, lo } // Uint64 return a uniformly-distributed random uint64 value. func (p *PCG) Uint64() uint64 { hi, lo := p.next() // XSL-RR would be // hi, lo := p.next() // return bits.RotateLeft64(lo^hi, -int(hi>>58))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 2.9K 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)