- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Kinners (1.09 sec)
-
android/guava/src/com/google/common/collect/Iterables.java
* smaller). For example, partitioning an iterable containing {@code [a, b, c, d, e]} with a * partition size of 3 yields {@code [[a, b, c], [d, e]]} -- an outer iterable containing two * inner lists of three and two elements, all in the original order. * * <p>Iterators returned by the returned iterable do not support the {@link Iterator#remove()}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Random; import java.util.RandomAccess; import org.junit.Test; import org.junit.runner.RunWith; import org.junit.runners.JUnit4; /** Tests for repeated node and edge addition and removal in a {@link Network}. */ @RunWith(JUnit4.class) public final class NetworkMutationTest { private static final int NUM_TRIALS = 5;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/NetworkMutationTest.java
import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Random; import java.util.RandomAccess; import org.junit.Test; import org.junit.runner.RunWith; import org.junit.runners.JUnit4; /** Tests for repeated node and edge addition and removal in a {@link Network}. */ @RunWith(JUnit4.class) public final class NetworkMutationTest { private static final int NUM_TRIALS = 5;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
} @SuppressWarnings("unchecked") final Segment<K, V, E, S>[] newSegmentArray(int ssize) { return (Segment<K, V, E, S>[]) new Segment<?, ?, ?, ?>[ssize]; } // Inner Classes /** * Segments are specialized versions of hash tables. This subclass inherits from ReentrantLock * opportunistically, just to simplify some locking and avoid separate construction. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Synchronized.java
* backing collection and the mutex are serializable. * * <p>If {@code null} is passed as the {@code mutex} parameter to any of this class's top-level * methods or inner class constructors, the created object uses itself as the synchronization mutex. * * <p>This class should be used by other collection classes only. * * @author Mike Bostock * @author Jared Levy */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 53.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
} // Static factories /** * Returns an ordering based on an <i>existing</i> comparator instance. Note that it is * unnecessary to create a <i>new</i> anonymous inner class implementing {@code Comparator} just * to pass it in here. Instead, simply subclass {@code Ordering} and implement its {@code compare} * method directly. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* smaller). For example, partitioning an iterator containing {@code [a, b, c, d, e]} with a * partition size of 3 yields {@code [[a, b, c], [d, e]]} -- an outer iterator containing two * inner lists of three and two elements, all in the original order. * * <p>The returned lists implement {@link java.util.RandomAccess}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0)