- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 270 for Implementation (0.35 sec)
-
guava-testlib/src/com/google/common/testing/GcFinalization.java
* hint, so this technique may fail at the whim of the JDK implementation, for example if a user * specified the JVM flag {@code -XX:+DisableExplicitGC}. But in practice, it works very well for * ordinary tests. * * <p>Failure of the expected event to occur within an implementation-defined "reasonable" time * period or an interrupt while waiting for the expected event will result in a {@link
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 17:40:56 UTC 2024 - 11.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
import java.util.Map; import java.util.NoSuchElementException; import java.util.Set; import java.util.SortedMap; import java.util.SortedSet; import java.util.TreeMap; import javax.annotation.CheckForNull; /** * Implementation of {@code Table} whose row keys and column keys are ordered by their natural * ordering or by supplied comparators. When constructing a {@code TreeBasedTable}, you may provide
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 11.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
import org.junit.After; import org.junit.Before; import org.junit.Test; /** * Abstract base class for testing implementations of {@link Graph} interface. Graph instances * created for testing should have Integer node and String edge objects. * * <p>Test cases that should be handled similarly in any graph implementation are included in this * class. For example, testing that {@code nodes()} method returns the set of the nodes in the
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* one of the predefined {@link Policies} or specify a custom implementation. Implementations must * be thread-safe. * * @since 13.0 */ public interface Policy { /** * Called when a potential deadlock is encountered. Implementations can throw the given {@code * exception} and/or execute other desired logic. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/MultisetTestSuiteBuilder.java
import java.util.List; import java.util.Map; import java.util.Set; import junit.framework.TestSuite; /** * Creates, based on your criteria, a JUnit test suite that exhaustively tests a {@code Multiset} * implementation. * * @author Jared Levy * @author Louis Wasserman */ @GwtIncompatible public class MultisetTestSuiteBuilder<E> extends AbstractCollectionTestSuiteBuilder<MultisetTestSuiteBuilder<E>, E> {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 10.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link BiMap} backed by two hash tables. This implementation allows null keys and values. A * {@code HashBiMap} and its inverse are both serializable. * * <p>This implementation guarantees insertion-based iteration order of its keys. * * <p>See the Guava User Guide article on <a href=
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* </ul> * <li>another java.util.Map delegate implementation. In most modern JDKs, normal java.util hash * collections intelligently fall back to a binary search tree if hash table collisions are * detected. Rather than going to all the trouble of reimplementing this ourselves, we * simply switch over to use the JDK implementation wholesale if probable hash flooding is
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 35.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster * than the straightforward ternary expression. */ @VisibleForTesting static int lessThanBranchFree(long x, long y) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
* compare} methods unconditionally, the {@code ComparisonChain} implementation stops calling its * inputs' {@link Comparable#compareTo compareTo} and {@link Comparator#compare compare} methods as * soon as one of them returns a nonzero result. This optimization is typically important only in * the presence of expensive {@code compareTo} and {@code compare} implementations. * * <p>See the Guava User Guide article on <a href=
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 21 17:28:11 UTC 2022 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster * than the straightforward ternary expression. */ @VisibleForTesting static int lessThanBranchFree(long x, long y) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0)