- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 505 for bitPos (0.48 sec)
-
src/os/types.go
// A FileMode represents a file's mode and permission bits. // The bits have the same definition on all systems, so that // information about files can be moved from one system // to another portably. Not all bits apply to all systems. // The only required bit is [ModeDir] for directories. type FileMode = fs.FileMode // The defined file mode bits are the most significant bits of the [FileMode].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 20:52:06 UTC 2024 - 2.9K bytes - Viewed (0) -
src/runtime/mbitmap.go
} if tp.typ == nil { // Handle small objects. // Clear any bits before the target address. tp.mask &^= (1 << ((target - tp.addr) / goarch.PtrSize)) - 1 // Clear any bits past the limit. if tp.addr+goarch.PtrSize*ptrBits > limit { bits := (tp.addr + goarch.PtrSize*ptrBits - limit) / goarch.PtrSize tp.mask &^= ((1 << (bits)) - 1) << (ptrBits - bits) } return tp } // Move up elem and addr.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K 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/internal/fuzz/coverage.go
b |= b >> 4 b -= b >> 1 coverageSnapshot[i] = b } } // diffCoverage returns a set of bits set in snapshot but not in base. // If there are no new bits set, diffCoverage returns nil. func diffCoverage(base, snapshot []byte) []byte { if len(base) != len(snapshot) { panic(fmt.Sprintf("the number of coverage bits changed: before=%d, after=%d", len(base), len(snapshot))) } found := false for i := range snapshot {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 18:23:49 UTC 2024 - 2.5K 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/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) -
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/compress/lzw/writer.go
} // writeLSB writes the code c for "Least Significant Bits first" data. func (w *Writer) writeLSB(c uint32) error { w.bits |= c << w.nBits w.nBits += w.width for w.nBits >= 8 { if err := w.w.WriteByte(uint8(w.bits)); err != nil { return err } w.bits >>= 8 w.nBits -= 8 } return nil } // writeMSB writes the code c for "Most Significant Bits first" data. func (w *Writer) writeMSB(c uint32) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 7.9K bytes - Viewed (0)