- Sort Score
- Num 10 results
- Language All
Results 61 - 70 of 166 for bits (0.21 seconds)
-
api/except.txt
pkg syscall (openbsd-386), const SizeofRtMsghdr = 88 pkg syscall (openbsd-386), const TIOCGTSTAMP = 1074295899 pkg syscall (openbsd-386), type Dirent struct, Fileno uint32 pkg syscall (openbsd-386), type FdSet struct, Bits [32]int32 pkg syscall (openbsd-386), type Kevent_t struct, Data int32 pkg syscall (openbsd-386), type Mclpool struct, Grown uint32 pkg syscall (openbsd-386), type RtMetrics struct, Expire uint32
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Sun Jun 16 23:08:08 GMT 2024 - 34.8K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
} private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 10.2K bytes - Click Count (0) -
src/cmd/asm/internal/asm/parse.go
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Wed Nov 12 03:59:40 GMT 2025 - 37.3K bytes - Click Count (0) -
guava/src/com/google/common/hash/SipHashFunction.java
// The number of compression rounds. private final int c; // The number of finalization rounds. private final int d; // Two 64-bit keys (represent a single 128-bit key). private final long k0; private final long k1; /** * @param c the number of compression rounds (must be positive) * @param d the number of finalization rounds (must be positive)
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Feb 13 17:34:21 GMT 2025 - 5.3K bytes - Click Count (0) -
src/builtin/builtin.go
// necessarily representing UTF-8-encoded text. A string may be empty, but // not nil. Values of string type are immutable. type string string // int is a signed integer type that is at least 32 bits in size. It is a // distinct type, however, and not an alias for, say, int32. type int int // uint is an unsigned integer type that is at least 32 bits in size. It is a
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Mon Dec 30 23:59:23 GMT 2024 - 12.8K bytes - Click Count (0) -
internal/grid/msg.go
OpResponse // OpDisconnect instructs that remote wants to disconnect OpDisconnect // OpMerged is several operations merged into one. OpMerged ) const ( // FlagCRCxxh3 indicates that, the lower 32 bits of xxhash3 of the serialized // message will be sent after the serialized message as little endian. FlagCRCxxh3 Flags = 1 << iota // FlagEOF the stream (either direction) is at EOF. FlagEOF
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Jul 25 21:07:21 GMT 2024 - 7.6K bytes - Click Count (0) -
guava/src/com/google/common/hash/MessageDigestHashFunction.java
try { Object unused = digest.clone(); return true; } catch (CloneNotSupportedException e) { return false; } } @Override public int bits() { return bytes * Byte.SIZE; } @Override public String toString() { return toString; } private static MessageDigest getMessageDigest(String algorithmName) { try {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Feb 13 17:34:21 GMT 2025 - 4.9K bytes - Click Count (0) -
cmd/xl-storage-format-v1_gen.go
func (z *ObjectPartInfo) UnmarshalMsg(bts []byte) (o []byte, err error) { var field []byte _ = field var zb0001 uint32 zb0001, bts, err = msgp.ReadMapHeaderBytes(bts) if err != nil { err = msgp.WrapError(err) return } var zb0001Mask uint8 /* 3 bits */ _ = zb0001Mask for zb0001 > 0 { zb0001-- field, bts, err = msgp.ReadMapKeyZC(bts) if err != nil { err = msgp.WrapError(err)
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 41.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
for (int b = 0; b < 4; ++b) { for (int bit = 128; bit != 0; bit >>= 1) { expected[b][bit] = next; next = advanceOneBit(next); } } for (int b = 0; b < 4; ++b) { expected[b][0] = 0; for (int bit = 2; bit < 256; bit <<= 1) { for (int i = bit + 1; i < (bit << 1); i++) { expected[b][i] = expected[b][bit] ^ expected[b][i ^ bit]; } } }
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Aug 11 19:31:30 GMT 2025 - 6.6K bytes - Click Count (0) -
guava/src/com/google/common/hash/Murmur3_128HashFunction.java
// TODO(user): when the shortcuts are implemented, update BloomFilterStrategies private final int seed; Murmur3_128HashFunction(int seed) { this.seed = seed; } @Override public int bits() { return 128; } @Override public Hasher newHasher() { return new Murmur3_128Hasher(seed); } @Override public String toString() { return "Hashing.murmur3_128(" + seed + ")";
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Apr 14 16:36:11 GMT 2025 - 5.8K bytes - Click Count (0)