- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 270 for Implementation (0.24 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/google/SortedMultisetTestSuiteBuilder.java
import java.util.HashSet; import java.util.List; import java.util.Set; import junit.framework.TestSuite; /** * Creates, based on your criteria, a JUnit test suite that exhaustively tests a {@code * SortedMultiset} implementation. * * <p><b>Warning:</b> expects that {@code E} is a String. * * @author Louis Wasserman */ @GwtIncompatible public class SortedMultisetTestSuiteBuilder<E> extends MultisetTestSuiteBuilder<E> {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 11.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/FeatureSpecificTestSuiteBuilder.java
/** * Prevents the given methods from being run as part of the test suite. * * <p>Note: in principle this should never need to be used, but it might be useful if the * semantics of an implementation disagree in unforeseen ways with the semantics expected by a * test, or to keep dependent builds clean in spite of an erroneous test. */ @CanIgnoreReturnValue public B suppressing(Method... methods) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 10.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/GeneralRange.java
/** * A generalized interval on any ordering, for internal use. Supports {@code null}. Unlike {@link * Range}, this allows the use of an arbitrary comparator. This is designed for use in the * implementation of subcollections of sorted collection types. * * <p>Whenever possible, use {@code Range} instead, which is better supported. * * @author Louis Wasserman */ @GwtCompatible(serializable = true)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/ServiceManagerTest.java
assertEquals(0, logHandler.getStoredLogRecords().size()); } public void testPartiallyConstructedManager_transitionAfterAddListenerBeforeStateIsReady() { // The implementation of this test is pretty sensitive to the implementation :( but we want to // ensure that if weird things happen during construction then we get exceptions. final NoOpService service1 = new NoOpService();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 02 17:20:27 UTC 2023 - 23.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/GeneralRange.java
/** * A generalized interval on any ordering, for internal use. Supports {@code null}. Unlike {@link * Range}, this allows the use of an arbitrary comparator. This is designed for use in the * implementation of subcollections of sorted collection types. * * <p>Whenever possible, use {@code Range} instead, which is better supported. * * @author Louis Wasserman */ @GwtCompatible(serializable = true)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* <li>Is there only one path to any node that's reachable from any start node? (If so, the graph * to be traversed is a tree or forest even if it is a subgraph of a graph which is neither.) * <li>Are the node objects' implementations of {@code equals()}/{@code hashCode()} <a * href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursive</a>? * </ol> * * <p>If your answers are: * * <ul>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
* <li>Is there only one path to any node that's reachable from any start node? (If so, the graph * to be traversed is a tree or forest even if it is a subgraph of a graph which is neither.) * <li>Are the node objects' implementations of {@code equals()}/{@code hashCode()} <a * href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursive</a>? * </ol> * * <p>If your answers are: * * <ul>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
* </ul> * * <p>This is reflexive and symmetric, but not transitive, so it is not an * equivalence relation and not suitable for use in {@link Object#equals} * implementations. * * @throws IllegalArgumentException if {@code tolerance} is {@code < 0} or NaN * @since 13.0 */ public static boolean fuzzyEquals(double a, double b, double tolerance) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleMath.java
* </ul> * * <p>This is reflexive and symmetric, but not transitive, so it is not an * equivalence relation and not suitable for use in {@link Object#equals} * implementations. * * @throws IllegalArgumentException if {@code tolerance} is {@code < 0} or NaN * @since 13.0 */ public static boolean fuzzyEquals(double a, double b, double tolerance) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* its comparator (which might be the element that was just added). This is different from * conventional bounded queues, which either block or reject new elements when full. * * <p>This implementation is based on the <a * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al. * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0)