- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for gbit16 (0.28 sec)
-
src/syscall/exec_plan9.go
// It returns the string as a byte slice, or nil if b is too short to contain the length or // the full string. // //go:nosplit func gstringb(b []byte) []byte { if len(b) < 2 { return nil } n, b := gbit16(b) if int(n) > len(b) { return nil } return b[:n] } // Offset of the name field in a 9P directory entry - see UnmarshalDir() in dir_plan9.go const nameOffset = 39
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 21:03:59 UTC 2024 - 13.3K bytes - Viewed (0) -
src/math/bits/bits_test.go
} x16 := uint16(m) got16 := RotateLeft16(x16, int(k)) want16 := x16<<(k&0xf) | x16>>(16-k&0xf) if got16 != want16 { t.Fatalf("RotateLeft16(%#04x, %d) == %#04x; want %#04x", x16, k, got16, want16) } got16 = RotateLeft16(want16, -int(k)) if got16 != x16 { t.Fatalf("RotateLeft16(%#04x, -%d) == %#04x; want %#04x", want16, k, got16, x16) } x32 := uint32(m)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 22 20:11:06 UTC 2020 - 32.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int bit1 = 0; bit1 < keyBits; bit1++) { for (int bit2 = 0; bit2 < keyBits; bit2++) { if (bit2 <= bit1) continue; int delta = (1 << bit1) | (1 << bit2); int[] same = new int[hashBits]; int[] diff = new int[hashBits]; // go through trials to compute probability
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 25.3K bytes - Viewed (0)