Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for ReverseBytes (0.06 sec)

  1. src/test/java/jcifs/pac/PacLogonInfoTest.java

            dos.writeShort(Short.reverseBytes(value));
        }
    
        private void writeLittleEndianInt(DataOutputStream dos, int value) throws IOException {
            dos.writeInt(Integer.reverseBytes(value));
        }
    
        private void writeLittleEndianLong(DataOutputStream dos, long value) throws IOException {
            dos.writeLong(Long.reverseBytes(value));
        }
    
        @Test
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 12.3K bytes
    - Viewed (0)
  2. 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 Dec 30 11:13:12 UTC 2025
    - Last Modified: Mon Oct 04 20:20:20 UTC 2021
    - 10.7K bytes
    - Viewed (0)
  3. 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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  4. 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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  5. 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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  6. android/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 Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
Back to top