- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for Intermediate (0.25 sec)
-
guava-tests/test/com/google/common/math/QuantilesTest.java
assertThrows(IllegalArgumentException.class, () -> intermediate.indexes(1, -1, 3)); } public void testScale_indexes_varargs_tooHigh() { Quantiles.Scale intermediate = Quantiles.scale(10); assertThrows(IllegalArgumentException.class, () -> intermediate.indexes(1, 11, 3)); } public void testScale_indexes_collection_negative() {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
assertThrows(IllegalArgumentException.class, () -> intermediate.indexes(1, -1, 3)); } public void testScale_indexes_varargs_tooHigh() { Quantiles.Scale intermediate = Quantiles.scale(10); assertThrows(IllegalArgumentException.class, () -> intermediate.indexes(1, 11, 3)); } public void testScale_indexes_collection_negative() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
this.filter = filter; this.containsZero = containsZero; } private static final int C1 = 0xcc9e2d51; private static final int C2 = 0x1b873593; /* * This method was rewritten in Java from an intermediate step of the Murmur hash function in * http://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp, which contained the * following header: *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* * <p>This uses an efficient binary recursive algorithm to compute the factorial with balanced * multiplies. It also removes all the 2s from the intermediate products (shifting them back in at * the end). * * @throws IllegalArgumentException if {@code n < 0} */ public static BigInteger factorial(int n) { checkNonNegative("n", n);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Hashing.java
* enough precision. */ private static final long C1 = 0xcc9e2d51; private static final long C2 = 0x1b873593; /* * This method was rewritten in Java from an intermediate step of the Murmur hash function in * http://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp, which contained the * following header: *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Hashing.java
* enough precision. */ private static final long C1 = 0xcc9e2d51; private static final long C2 = 0x1b873593; /* * This method was rewritten in Java from an intermediate step of the Murmur hash function in * http://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp, which contained the * following header: *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/AbstractStreamingHasher.java
} /* * Note: hashString(CharSequence, Charset) is intentionally not overridden. * * While intuitively, using CharsetEncoder to encode the CharSequence directly to the buffer (or * even to an intermediate buffer) should be considerably more efficient than potentially * copying the CharSequence to a String and then calling getBytes(Charset) on that String, in
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
long a = (low ^ high) * K3; a ^= (a >>> 47); long b = (high ^ a) * K3; b ^= (b >>> 47); b *= K3; return b; } /** * Computes intermediate hash of 32 bytes of byte array from the given offset. Results are * returned in the output array - this is 12% faster than allocating new arrays every time. */ private static void weakHashLength32WithSeeds(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Dec 28 17:50:25 GMT 2021 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LinearTransformation.java
*/ public static LinearTransformationBuilder mapping(double x1, double y1) { checkArgument(isFinite(x1) && isFinite(y1)); return new LinearTransformationBuilder(x1, y1); } /** * This is an intermediate stage in the construction process. It is returned by {@link * LinearTransformation#mapping}. You almost certainly don't want to keep instances around, but
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
this.filter = filter; this.containsZero = containsZero; } private static final int C1 = 0xcc9e2d51; private static final int C2 = 0x1b873593; /* * This method was rewritten in Java from an intermediate step of the Murmur hash function in * http://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp, which contained the * following header: *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0)