Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for pubBytes (0.04 seconds)

  2. github.com/google/guava

    android/guava-tests/test/com/google/common/hash/HashTestUtils.java 

        ByteBuffer bigEndian = ByteBuffer.wrap(bytes).order(ByteOrder.BIG_ENDIAN);
    assertEquals(
        hashFunction.newHasher().putBytes(littleEndian).hash(),
        hashFunction.newHasher().putBytes(bigEndian).hash());
    assertEquals(ByteOrder.LITTLE_ENDIAN, littleEndian.order());
    assertEquals(ByteOrder.BIG_ENDIAN, bigEndian.order());
  }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  3. github.com/google/guava

    guava-tests/test/com/google/common/hash/HashTestUtils.java 

        ByteBuffer bigEndian = ByteBuffer.wrap(bytes).order(ByteOrder.BIG_ENDIAN);
    assertEquals(
        hashFunction.newHasher().putBytes(littleEndian).hash(),
        hashFunction.newHasher().putBytes(bigEndian).hash());
    assertEquals(ByteOrder.LITTLE_ENDIAN, littleEndian.order());
    assertEquals(ByteOrder.BIG_ENDIAN, bigEndian.order());
  }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  4. github.com/google/guava

    android/guava/src/com/google/common/hash/HashFunction.java 

       */
  HashCode hashLong(long input);

  /**
   * Shortcut for {@code newHasher().putBytes(input).hash()}. The implementation <i>might</i>
   * perform better than its longhand equivalent, but should not perform worse.
   */
  HashCode hashBytes(byte[] input);

  /**
   * Shortcut for {@code newHasher().putBytes(input, off, len).hash()}. The implementation
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.9K bytes
    - Click Count (0)
  5. github.com/google/guava

    guava/src/com/google/common/hash/HashFunction.java 

       */
  HashCode hashLong(long input);

  /**
   * Shortcut for {@code newHasher().putBytes(input).hash()}. The implementation <i>might</i>
   * perform better than its longhand equivalent, but should not perform worse.
   */
  HashCode hashBytes(byte[] input);

  /**
   * Shortcut for {@code newHasher().putBytes(input, off, len).hash()}. The implementation
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.9K bytes
    - Click Count (0)
Back to Top