- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 21 for play (0.15 sec)
-
guava-gwt/src-super/com/google/common/util/concurrent/super/com/google/common/util/concurrent/Uninterruptibles.java
throws ExecutionException { try { return future.get(); } catch (InterruptedException e) { // Should never be thrown in GWT but play it safe throw new IllegalStateException(e); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 08 20:30:27 GMT 2022 - 1.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
letter, nearly as large as himself, and this he handed over to the other, saying, in a solemn tone, `For the Duchess. An invitation from the Queen to play croquet.' The Frog-Footman repeated, in the same solemn tone, only changing the order of the words a little, `From the Queen. An invitation for the Duchess to play croquet.' Then they both bowed low, and their curls got entangled together.
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
for (int i = 0; i < reps; i++) { Integer key = keys.get(random.nextInt(nKeys)); // This range is [-5, 4] - slight negative bias so we often hit zero, which brings the // auto-removal of zeroes into play. int delta = random.nextInt(10) - 5; blah += delta; if (delta >= 0) { multiset.add(key, delta); } else { multiset.remove(key, -delta); } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 09 15:17:25 GMT 2018 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
if (array[min] > array[index]) { min = index; } } if (min != from) { swap(array, min, from); } return; } // Let's play quickselect! We'll repeatedly partition the range [from, to] containing the // required element, as long as it has more than one element. while (to > from) { int partitionPoint = partition(array, from, to);
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-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
for (int i = 0; i < reps; i++) { Integer key = keys.get(random.nextInt(nKeys)); // This range is [-5, 4] - slight negative bias so we often hit zero, which brings the // auto-removal of zeroes into play. int delta = random.nextInt(10) - 5; blah += delta; if (delta >= 0) { multiset.add(key, delta); } else { multiset.remove(key, -delta); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 06 12:56:11 GMT 2023 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* <i>previous</i> request, this means that the very next request after an invocation to {@code * setRate} will not be affected by the new rate; it will pay the cost of the previous request, * which is in terms of the previous rate. * * <p>The behavior of the {@code RateLimiter} is not modified in any other way, e.g. if the {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
long mulMod(long a, long b, long m) { /* * lowasser, 2015-Feb-12: Benchmarks suggest that changing this to UnsignedLongs.remainder * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum * constant hurts performance further -- I suspect because bimorphic implementation is a * sweet spot for the JVM. */ return (a * b) % m; }
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/src/com/google/common/util/concurrent/ExecutionSequencer.java
return callable.call(); } @Override public String toString() { return callable.toString(); } }; /* * Four futures are at play here: * taskFuture is the future tracking the result of the callable. * newFuture is a future that completes after this and all prior tasks are done. * oldFuture is the previous task's newFuture.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 22.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/PopulatedCachesTest.java
return builder.recordStats().build(identityLoader()); } }); } private CacheBuilderFactory cacheFactory() { // This is trickier than expected. We plan to put 15 values in each of these (WARMUP_MIN to // WARMUP_MAX), but the tests assume no values get evicted. Even with a maximumSize of 100, one
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 15K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/AbstractPackageSanityTests.java
* C} will be excluded from automated serialization test performed by this method. */ @Test public void testSerializable() throws Exception { // TODO: when we use @BeforeClass, we can pay the cost of class path scanning only once. for (Class<?> classToTest : findClassesToTest(loadClassesInPackage(), SERIALIZABLE_TEST_METHOD_NAMES)) { if (Serializable.class.isAssignableFrom(classToTest)) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri May 12 19:22:18 GMT 2023 - 17.5K bytes - Viewed (0)