- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 64 for exists (0.18 sec)
-
android/guava-testlib/test/com/google/common/collect/testing/features/FeatureUtilTest.java
// Exists to test that our framework doesn't run it: @SuppressWarnings("unused") @ExampleDerivedFeature.Require({ ExampleDerivedFeature.DERIVED_FEATURE_1, ExampleDerivedFeature.DERIVED_FEATURE_2 }) public void testRequiringTwoExplicitDerivedFeatures() throws Exception { doNotActuallyRunThis(); } // Exists to test that our framework doesn't run it:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 10.4K bytes - Viewed (2) -
guava-testlib/test/com/google/common/collect/testing/features/FeatureUtilTest.java
// Exists to test that our framework doesn't run it: @SuppressWarnings("unused") @ExampleDerivedFeature.Require({ ExampleDerivedFeature.DERIVED_FEATURE_1, ExampleDerivedFeature.DERIVED_FEATURE_2 }) public void testRequiringTwoExplicitDerivedFeatures() throws Exception { doNotActuallyRunThis(); } // Exists to test that our framework doesn't run it:
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* connectedRange}, if such a range exists. * * <p>For example, the intersection of {@code [1..5]} and {@code (3..7)} is {@code (3..5]}. The * resulting range may be empty; for example, {@code [1..5)} intersected with {@code [5..7)} * yields the empty range {@code [5..5)}. * * <p>The intersection exists if and only if the two ranges are {@linkplain #isConnected * connected}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 27.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
* @param target a primitive {@code char} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(char[] array, char target) { return indexOf(array, target, 0, array.length); } // TODO(kevinb): consider making this public
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Doubles.java
* @param target a primitive {@code double} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(double[] array, double target) { return indexOf(array, target, 0, array.length); } // TODO(kevinb): consider making this public
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 27.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
* @param array an array of {@code int} values, possibly empty * @param target a primitive {@code int} value * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no * such index exists. */ public static int indexOf(int[] array, int target) { return indexOf(array, target, 0, array.length); } // TODO(kevinb): consider making this public
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMultiset.java
throw new InvalidObjectException("Use SerializedForm"); } /** * Not supported. Use {@link #toImmutableSortedMultiset} instead. This method exists only to hide * {@link ImmutableMultiset#toImmutableMultiset} from consumers of {@code * ImmutableSortedMultiset}. * * @throws UnsupportedOperationException always
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 29.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
@ElementTypesAreNonnullByDefault public abstract class TreeTraverser<T> { /** * Returns a tree traverser that uses the given function to navigate from a node to its children. * This is useful if the function instance already exists, or so that you can supply a lambda * expressions. If those circumstances don't apply, you probably don't need to use this; subclass * {@code TreeTraverser} and implement its {@link #children} method directly. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
} return null; } } private static final class InCompletionOrderState<T extends @Nullable Object> { // A happens-before edge between the writes of these fields and their reads exists, because // in order to read these fields, the corresponding write to incompleteOutputCount must have // been read. private boolean wasCancelled = false; private boolean shouldInterrupt = true;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* available, a new Cell is created. Otherwise, if the slot * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)