- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for Friend (0.39 sec)
-
guava-tests/test/com/google/common/collect/SetOperationsTest.java
Set<String> friends = Sets.newHashSet("Tom", "Joe", "Dave"); Set<String> enemies = Sets.newHashSet("Dick", "Harry", "Tom"); Set<String> goodFriends = Sets.difference(friends, enemies); assertEquals(2, goodFriends.size()); ImmutableSet<String> immut = Sets.difference(friends, enemies).immutableCopy(); HashSet<String> mut = Sets.difference(friends, enemies).copyInto(new HashSet<String>());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 14.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
resetContainer(); } /** * @return the contents of the container under test, for use by {@link #expectContents(Object[]) * expectContents(E...)} and its friends. */ protected abstract Collection<E> actualContents(); /** * Replaces the existing container under test with a new container created by the subject * generator. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 8.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * 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
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
* cause if this Future has failed. * * - And this future *has* failed: This method is called only from handleException (through * getOrInitSeenExceptions). handleException tried to call setException and failed, so * either this Future was cancelled (which we ruled out with the isCancelled check above), * or it had already failed. (It couldn't have completed *successfully* or even had
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/ClassSanityTester.java
* <li>The non-private constructor or non-private static factory method with the most parameters * is used to construct the sample instances. In case of tie, the candidate constructors or * factories are tried one after another until one can be used to construct sample * instances. * <li>For the constructor or static factory method used to construct instances, it's checked
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 08 17:31:55 GMT 2024 - 33K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * 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
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
resetContainer(); } /** * @return the contents of the container under test, for use by {@link #expectContents(Object[]) * expectContents(E...)} and its friends. */ protected abstract Collection<E> actualContents(); /** * Replaces the existing container under test with a new container created by the subject * generator. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 8.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* the capacity, it is doubled in size unless some other thread * holds the lock. If a hashed slot is empty, and lock is * 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
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) -
android/guava-tests/test/com/google/common/collect/SetOperationsTest.java
Set<String> friends = Sets.newHashSet("Tom", "Joe", "Dave"); Set<String> enemies = Sets.newHashSet("Dick", "Harry", "Tom"); Set<String> goodFriends = Sets.difference(friends, enemies); assertEquals(2, goodFriends.size()); ImmutableSet<String> immut = Sets.difference(friends, enemies).immutableCopy(); HashSet<String> mut = Sets.difference(friends, enemies).copyInto(new HashSet<String>());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 14.7K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/ClassSanityTester.java
* <li>The non-private constructor or non-private static factory method with the most parameters * is used to construct the sample instances. In case of tie, the candidate constructors or * factories are tried one after another until one can be used to construct sample * instances. * <li>For the constructor or static factory method used to construct instances, it's checked
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 08 17:31:55 GMT 2024 - 33K bytes - Viewed (0)