- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 70 for Skinner (0.18 sec)
-
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/BuildModelTransformer.java
String version = model.getVersion(); String modVersion = replaceCiFriendlyVersion(context, version); builder.version(modVersion); } // // Infer inner reactor dependencies version // void handleReactorDependencies(ModelTransformerContext context, Model model, Path pomFile, Model.Builder builder) { List<Dependency> newDeps = new ArrayList<>();
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
fail(); } catch (CancellationException expected) { // There should be two CancellationException chained together. The outer one should have the // stack trace of where the get() call was made, and the inner should have the stack trace of // where the immediateCancelledFuture() call was made. List<StackTraceElement> stackTrace = ImmutableList.copyOf(expected.getStackTrace());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 42.5K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
} } } @SuppressWarnings("unchecked") final Segment<K, V>[] newSegmentArray(int ssize) { return (Segment<K, V>[]) 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java
} static <N, E> DirectedMultiNetworkConnections<N, E> of() { return new DirectedMultiNetworkConnections<>( new HashMap<E, N>(INNER_CAPACITY, INNER_LOAD_FACTOR), new HashMap<E, N>(INNER_CAPACITY, INNER_LOAD_FACTOR), 0); } static <N, E> DirectedMultiNetworkConnections<N, E> ofImmutable( Map<E, N> inEdges, Map<E, N> outEdges, int selfLoopCount) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SynchronizedNavigableSetTest.java
@SuppressWarnings("unchecked") protected <E> NavigableSet<E> create() { TestSet<E> inner = new TestSet<>(new TreeSet<E>((Comparator<E>) Ordering.natural().nullsFirst()), null); NavigableSet<E> outer = Synchronized.navigableSet(inner, null); inner.mutex = outer; return outer; } static class TestSet<E> extends SynchronizedSetTest.TestSet<E> implements NavigableSet<E> {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE; // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps static final float INNER_LOAD_FACTOR = 1.0f; static final int INNER_CAPACITY = 2; // ceiling(EXPECTED_DEGREE / INNER_LOAD_FACTOR) // Error messages static final String NODE_NOT_IN_GRAPH = "Node %s is not an element of this graph.";
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SynchronizedNavigableSetTest.java
@SuppressWarnings("unchecked") protected <E> NavigableSet<E> create() { TestSet<E> inner = new TestSet<>(new TreeSet<E>((Comparator<E>) Ordering.natural().nullsFirst()), MUTEX); NavigableSet<E> outer = Synchronized.navigableSet(inner, MUTEX); return outer; } static class TestSet<E> extends SynchronizedSetTest.TestSet<E> implements NavigableSet<E> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 7.7K bytes - Viewed (0)