- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 78 for Mitake (0.14 sec)
-
guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
protected static final boolean expensiveTests = Boolean.getBoolean("jsr166.expensiveTests"); /** * If true, report on stdout all "slow" tests, that is, ones that take more than profileThreshold * milliseconds to execute. */ private static final boolean profileTests = Boolean.getBoolean("jsr166.profileTests"); /**
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
guava-testlib/test/com/google/common/testing/NullPointerTesterTest.java
* <li>normalNullable: only second param is Nullable * <li>nullableNullable: both params are Nullable * </ul> */ public static class TwoArg { /** Action to take on a null param. */ public enum Action { THROW_A_NPE { @Override public void act() { throw new NullPointerException(); } }, THROW_OTHER {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 16 15:12:31 GMT 2023 - 47.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* * <p>To compute quartiles, use {@link #quartiles()} instead of {@link #percentiles()}. To compute * arbitrary q-quantiles, use {@link #scale scale(q)}. * * <p>These examples all take a copy of your dataset. If you have a double array, you are okay with * it being arbitrarily reordered, and you want to avoid that copy, you can use {@code * computeInPlace} instead of {@code compute}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* been interrupted and is waiting to reacquire the lock while still registered in activeGuards, * in which case the signal is a no-op, and the bigger-picture signal is lost unless interrupted * threads take special action by participating in the signal-passing game. */ /* * Timeout handling is intricate, especially given our ambitious goals:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* bad. We do the leadingZeros check to avoid the division below if at all possible. * * Otherwise, if b == Long.MIN_VALUE, then the only allowed values of a are 0 and 1. We take * care of all a < 0 with their own check, because in particular, the case a == -1 will * incorrectly pass the division check below. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/escape/EscapersTest.java
assertEquals("XheXXuickXXrownXXoxX", builder.build().escape("The Quick Brown Fox!")); // Explicit replacements take priority over unsafe characters. builder.addEscape(' ', "_"); builder.addEscape('!', "_"); assertEquals("Xhe_Xuick_Xrown_Xox_", builder.build().escape("The Quick Brown Fox!")); // Explicit replacements take priority over safe characters. builder.setSafeRange(' ', '~');
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* overflow, depending on the real world consequences of not using the expected rate. * * Past underutilization could mean that excess resources are available. Then, the RateLimiter * should speed up for a while, to take advantage of these resources. This is important when the * rate is applied to networking (limiting bandwidth), where past underutilization typically * translates to "almost empty buffers", which can be filled immediately. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
* exactly matching hash codes, which would cause construction to take O(n^2), but can't detect * e.g. hash codes adversarially designed to go into ascending table locations, which keeps * construction O(n) (as desired) but then can have O(n) queries later. * * <p>If this returns false, then no query can take more than O(log n). *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ListenableFuture.java
* } * }, executor); * }</pre> * * <h3>How to get an instance</h3> * * <p>We encourage you to return {@code ListenableFuture} from your methods so that your users can * take advantage of the {@linkplain Futures utilities built atop the class}. The way that you will * create {@code ListenableFuture} instances depends on how you currently create {@code Future} * instances: * * <ul>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:13:41 GMT 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
@SuppressWarnings("nullness") // safe because we pass sort() a range that contains real Ts T[] castBuffer = (T[]) buffer; // We've already taken O(k log k), let's make sure we don't take longer than O(k log k). Arrays.sort(castBuffer, left, right + 1, comparator); break; } } bufferSize = k; threshold = uncheckedCastNullableTToT(buffer[minThresholdPosition]);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0)