- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for Rogers (0.18 sec)
-
android/guava-tests/test/com/google/common/collect/PackageSanityTests.java
* limitations under the License. */ package com.google.common.collect; import com.google.common.testing.AbstractPackageSanityTests; /** * Covers basic sanity checks for the entire package. * * @author Ben Yu */ public class PackageSanityTests extends AbstractPackageSanityTests { public PackageSanityTests() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/PopulatedCachesTest.java
* * @author mike nonemacher */ public class PopulatedCachesTest extends TestCase { // we use integers as keys; make sure the range covers some values that ARE cached by // Integer.valueOf(int), and some that are not cached. (127 is the highest cached value.) static final int WARMUP_MIN = 120; static final int WARMUP_MAX = 135;
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-tests/test/com/google/common/collect/PackageSanityTests.java
* limitations under the License. */ package com.google.common.collect; import com.google.common.testing.AbstractPackageSanityTests; /** * Covers basic sanity checks for the entire package. * * @author Ben Yu */ public class PackageSanityTests extends AbstractPackageSanityTests { public PackageSanityTests() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 10 21:41:58 GMT 2012 - 1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/PackageSanityTests.java
import static com.google.common.truth.Truth.assertWithMessage; import com.google.common.testing.AbstractPackageSanityTests; import junit.framework.AssertionFailedError; /** * Covers basic sanity checks for the entire package. * * @author Kurt Alfred Kluever */ public class PackageSanityTests extends AbstractPackageSanityTests { private static final AbstractGraphBuilder<?> GRAPH_BUILDER_A =
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
// The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
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) -
guava-tests/test/com/google/common/math/MathTesting.java
static { ImmutableSet.Builder<Integer> intValues = ImmutableSet.builder(); // Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/ServiceManagerTest.java
manager.stopAsync(); assertThrows(TimeoutException.class, () -> manager.awaitStopped(1, TimeUnit.MILLISECONDS)); manager.awaitStopped(5, SECONDS); // no exception thrown } /** * This covers a case where if the last service to stop failed then the stopped callback would * never be called. */ public void testSingleFailedServiceCallsStopped() { Service a = new FailStartService();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 02 17:20:27 GMT 2023 - 23.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} private static final int EVEN_POWERS_OF_TWO = 0x55555555; private static final int ODD_POWERS_OF_TWO = 0xaaaaaaaa; @VisibleForTesting static boolean isEvenLevel(int index) { int oneBased = ~~(index + 1); // for GWT checkState(oneBased > 0, "negative index"); return (oneBased & EVEN_POWERS_OF_TWO) > (oneBased & ODD_POWERS_OF_TWO); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathTesting.java
static { ImmutableSet.Builder<Integer> intValues = ImmutableSet.builder(); // Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
// The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0)