- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for rotateRight (0.68 sec)
-
guava/src/com/google/common/hash/Fingerprint2011.java
z += shiftMix(v[1]) * K1; x = rotateRight(z + x, 39) * K1; y = rotateRight(y, 33) * K1; // Decrease length to the nearest multiple of 64, and operate on 64-byte chunks. length = (length - 1) & ~63; do { x = rotateRight(x + y + v[0] + load64(bytes, offset + 16), 37) * K1; y = rotateRight(y + v[1] + load64(bytes, offset + 48), 42) * K1; x ^= w[1];
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
z += shiftMix(v[1]) * K1; x = rotateRight(z + x, 39) * K1; y = rotateRight(y, 33) * K1; // Decrease length to the nearest multiple of 64, and operate on 64-byte chunks. length = (length - 1) & ~63; do { x = rotateRight(x + y + v[0] + load64(bytes, offset + 16), 37) * K1; y = rotateRight(y + v[1] + load64(bytes, offset + 48), 42) * K1; x ^= w[1];
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
right = right.rotateRight(); } return rotateLeft(); case 2: // requireNonNull is safe because left must exist in order to get a positive factor. requireNonNull(left); if (left.balanceFactor() < 0) { left = left.rotateLeft(); } return rotateRight(); default: recomputeHeight();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.8K bytes - Viewed (0)