- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for ReverseBytes (0.11 sec)
-
guava/src/com/google/common/hash/LittleEndianByteArray.java
return Long.reverseBytes(bigEndian); } @Override public void putLongLittleEndian(byte[] array, int offset, long value) { // Reverse the order of the bytes before storing, since we're on big-endian hardware. long littleEndianValue = Long.reverseBytes(value);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 9.8K bytes - Viewed (0) -
api/go1.9.txt
pkg math/bits, func Reverse16(uint16) uint16 pkg math/bits, func Reverse32(uint32) uint32 pkg math/bits, func Reverse64(uint64) uint64 pkg math/bits, func Reverse8(uint8) uint8 pkg math/bits, func ReverseBytes(uint) uint pkg math/bits, func ReverseBytes16(uint16) uint16 pkg math/bits, func ReverseBytes32(uint32) uint32 pkg math/bits, func ReverseBytes64(uint64) uint64 pkg math/bits, func RotateLeft(uint, int) uint
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Oct 04 20:20:20 UTC 2021 - 10.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashingTest.java
} public void testHashIntReverseBytesVsHashBytesIntsToByteArray() { int input = 42; assertEquals( Hashing.md5().hashBytes(Ints.toByteArray(input)), Hashing.md5().hashInt(Integer.reverseBytes(input))); } public void testHashIntVsForLoop() { int input = 42; HashCode expected = Hashing.md5().hashInt(input); Hasher hasher = Hashing.md5().newHasher();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 09 17:40:09 UTC 2024 - 26.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* <i>little-endian</i> order. That is, hashing the byte array {@code {0x01, 0x02, 0x03, 0x04}} is * equivalent to hashing the {@code int} value {@code 0x04030201}. If this isn't what you need, * methods such as {@link Integer#reverseBytes} and {@link Ints#toByteArray} will help. * * <h3>Relationship to {@link Object#hashCode}</h3> * * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no separation
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* <i>little-endian</i> order. That is, hashing the byte array {@code {0x01, 0x02, 0x03, 0x04}} is * equivalent to hashing the {@code int} value {@code 0x04030201}. If this isn't what you need, * methods such as {@link Integer#reverseBytes} and {@link Ints#toByteArray} will help. * * <h3>Relationship to {@link Object#hashCode}</h3> * * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no separation
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
} // Then hash the result array byte[] result = hashFunction.hash(hashes, 0); // interpreted in little-endian order. int verification = Integer.reverseBytes(Ints.fromByteArray(result)); if (expected != verification) { throw new AssertionError( "Expected: " + Integer.toHexString(expected) + " got: "
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 23 14:22:54 UTC 2024 - 25.5K bytes - Viewed (0)