- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 56 for low (0.32 sec)
-
android/guava/src/com/google/common/escape/UnicodeEscaper.java
* <li><b>If the next character was a valid low surrogate, the code point value of the * high/low surrogate pair is returned.</b> * <li>If the next character was not a low surrogate value, then {@link * IllegalArgumentException} is thrown. * </ol> * <li>If the first character was a low surrogate value, {@link IllegalArgumentException} is * thrown.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 13.2K bytes - Viewed (0) -
guava/src/com/google/common/escape/UnicodeEscaper.java
* <li><b>If the next character was a valid low surrogate, the code point value of the * high/low surrogate pair is returned.</b> * <li>If the next character was not a low surrogate value, then {@link * IllegalArgumentException} is thrown. * </ol> * <li>If the first character was a low surrogate value, {@link IllegalArgumentException} is * thrown.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 13.2K bytes - Viewed (0) -
guava/src/com/google/common/math/Quantiles.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
private static long shiftMix(long val) { return val ^ (val >>> 47); } /** Implementation of Hash128to64 from util/hash/hash128to64.h */ @VisibleForTesting static long hash128to64(long high, long low) { long a = (low ^ high) * K3; a ^= (a >>> 47); long b = (high ^ a) * K3; b ^= (b >>> 47); b *= K3; return b; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Dec 28 17:50:25 UTC 2021 - 6.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
} // Perform a partition with the selected median. int low = from + 1, high = to; // Indexes for partitioning. double partition = array[from + 1]; // Choose partitioning element. while (true) { // Skip the elements smaller than the partition. do { low++; } while (array[low] < partition); // Skip the elements larger than the partition.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/escape/testing/EscaperAsserts.java
* * @param escaper the non-null escaper to test * @param expected the expected output string * @param hi the high surrogate pair character * @param lo the low surrogate pair character */ public static void assertUnicodeEscaping( UnicodeEscaper escaper, String expected, char hi, char lo) { int cp = Character.toCodePoint(hi, lo);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 3.8K bytes - Viewed (0) -
guava-testlib/src/com/google/common/escape/testing/EscaperAsserts.java
* * @param escaper the non-null escaper to test * @param expected the expected output string * @param hi the high surrogate pair character * @param lo the low surrogate pair character */ public static void assertUnicodeEscaping( UnicodeEscaper escaper, String expected, char hi, char lo) { int cp = Character.toCodePoint(hi, lo);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
int k1 = mixK1(input); int h1 = mixH1(seed, k1); return fmix(h1, Ints.BYTES); } @Override public HashCode hashLong(long input) { int low = (int) input; int high = (int) (input >>> 32); int k1 = mixK1(low); int h1 = mixH1(seed, k1); k1 = mixK1(high); h1 = mixH1(h1, k1); return fmix(h1, Longs.BYTES); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Jun 15 20:59:00 UTC 2022 - 11.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hasher.java
@Override Hasher putChar(char c); /** * Equivalent to processing each {@code char} value in the {@code CharSequence}, in order. In * other words, no character encoding is performed; the low byte and high byte of each {@code * char} are hashed directly (in that order). The input must not be updated while this method is * in progress. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Jun 15 20:59:00 UTC 2022 - 5.5K bytes - Viewed (0)