- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for odd (0.32 sec)
-
guava-tests/test/com/google/common/util/concurrent/UncheckedThrowingFuture.java
* not wrapped in {@code ExecutionException}. For just a normal failure, use {@link * SettableFuture}). * * <p>Useful for testing the behavior of Future utilities against odd futures. * * @author Anthony Zana */ @GwtCompatible final class UncheckedThrowingFuture<V> extends AbstractFuture<V> { public static <V> ListenableFuture<V> throwingError(Error error) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 12 20:02:10 GMT 2018 - 3.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/UncheckedThrowingFuture.java
* not wrapped in {@code ExecutionException}. For just a normal failure, use {@link * SettableFuture}). * * <p>Useful for testing the behavior of Future utilities against odd futures. * * @author Anthony Zana */ @GwtCompatible final class UncheckedThrowingFuture<V> extends AbstractFuture<V> { public static <V> ListenableFuture<V> throwingError(Error error) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 12 20:02:10 GMT 2018 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
* We round up if either the fractional part of signif is strictly greater than 0.5 (which is * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set). */ boolean increment = (twiceSignifFloor & 1) != 0 && ((signifFloor & 1) != 0 || absX.getLowestSetBit() < shift);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 28 15:37:52 GMT 2021 - 5.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
final int s1 = min + (1 * range) / 4; final int s2 = min + (2 * range) / 4; final int s3 = min + (3 * range) / 4; final char[] dst = new char[12]; // Put surrogate pairs at odd indices so they can be split easily dst[0] = 'x'; Character.toChars(min, dst, 1); Character.toChars(s1, dst, 3); Character.toChars(s2, dst, 5); Character.toChars(s3, dst, 7);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
final int s1 = min + (1 * range) / 4; final int s2 = min + (2 * range) / 4; final int s3 = min + (3 * range) / 4; final char[] dst = new char[12]; // Put surrogate pairs at odd indices so they can be split easily dst[0] = 'x'; Character.toChars(min, dst, 1); Character.toChars(s1, dst, 3); Character.toChars(s2, dst, 5); Character.toChars(s3, dst, 7);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0)