Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for hashUnencodedChars (1.23 sec)

  1. guava-tests/test/com/google/common/hash/FarmHashFingerprint64Test.java

          }
        }
    
        String stringA = new String(charsA);
        String stringB = new String(charsB);
        assertThat(stringA).isNotEqualTo(stringB);
        assertThat(HASH_FN.hashUnencodedChars(stringA))
            .isNotEqualTo(HASH_FN.hashUnencodedChars(stringB));
        assertThat(fingerprint(stringA.getBytes(UTF_8)))
            .isNotEqualTo(fingerprint(stringB.getBytes(UTF_8)));
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 6.3K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/hash/Fingerprint2011Test.java

          }
        }
    
        String stringA = new String(charsA);
        String stringB = new String(charsB);
        assertThat(stringA).isNotEqualTo(stringB);
        assertThat(HASH_FN.hashUnencodedChars(stringA))
            .isNotEqualTo(HASH_FN.hashUnencodedChars(stringB));
        assertThat(fingerprint(stringA.getBytes(UTF_8)))
            .isNotEqualTo(fingerprint(stringB.getBytes(UTF_8)));
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 7.8K bytes
    - Viewed (0)
  3. guava/src/com/google/common/hash/AbstractNonStreamingHashFunction.java

      }
    
      @Override
      public HashCode hashLong(long input) {
        return hashBytes(ByteBuffer.allocate(8).order(ByteOrder.LITTLE_ENDIAN).putLong(input).array());
      }
    
      @Override
      public HashCode hashUnencodedChars(CharSequence input) {
        int len = input.length();
        ByteBuffer buffer = ByteBuffer.allocate(len * 2).order(ByteOrder.LITTLE_ENDIAN);
        for (int i = 0; i < len; i++) {
          buffer.putChar(input.charAt(i));
        }
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 04 15:39:10 UTC 2025
    - 4.8K bytes
    - Viewed (0)
Back to top