- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for fit (0.14 sec)
-
android/guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java
// Ordinarily we'd use something like i += Character.charCount(string.codePointAt(i)) here. But // we can get away with i++ because the whole point of this method is to return false if we find // a code point that doesn't fit in a char. for (int i = 0; i < string.length(); i++) { if (string.codePointAt(i) > 0xffff) { return false; } } return true; } @SuppressWarnings("deprecation")
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 08 13:56:22 GMT 2021 - 8.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java
// Ordinarily we'd use something like i += Character.charCount(string.codePointAt(i)) here. But // we can get away with i++ because the whole point of this method is to return false if we find // a code point that doesn't fit in a char. for (int i = 0; i < string.length(); i++) { if (string.codePointAt(i) > 0xffff) { return false; } } return true; } @SuppressWarnings("deprecation")
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 08 13:56:22 GMT 2021 - 8.6K bytes - Viewed (0)