- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 1,052 for into (0.15 sec)
-
maven-core/src/main/java/org/apache/maven/internal/aether/ReverseTreeRepositoryListener.java
} } /** * Returns {@code true} if passed in artifact is originating from local repository. In other words, we want * to process and store tracking information ONLY into local repository, not to any other place. This method * filters out currently built artifacts, as events are fired for them as well, but their resolved artifact
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Apr 12 11:08:37 GMT 2023 - 9.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* <li>(1) "yes" and (2) "no", you can use either, but {@code forTree()} will be more efficient. * <li>(1) "no" and (2) "yes", <b><i>neither will work</i></b>, but if you transform your node * objects into a non-recursive form, you can use {@code forGraph()}. * </ul> * * @author Jens Nyman * @param <N> Node parameter type * @since 23.1 */ @Beta @DoNotMock(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
return delegate.add(object); } int[] entries = requireEntries(); @Nullable Object[] elements = requireElements(); int newEntryIndex = this.size; // current size, and pointer to the entry to be appended int newSize = newEntryIndex + 1; int hash = smearedHash(object); int mask = hashTableMask(); int tableIndex = hash & mask; int next = CompactHashing.tableGet(requireTable(), tableIndex);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LoadingCache.java
* multiple threads can concurrently load values for distinct keys. * * <p>Caches loaded by a {@link CacheLoader} will call {@link CacheLoader#load} to load new values * into the cache. Newly loaded values are added to the cache using {@code * Cache.asMap().putIfAbsent} after loading has completed; if another value was associated with
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Aug 06 17:12:03 GMT 2022 - 8.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* to dump the queue into a newly allocated array of {@code String}: * * <pre> * String[] y = x.toArray(new String[0]);</pre> * * <p>Note that {@code toArray(new Object[0])} is identical in function to {@code toArray()}. * * @param a the array into which the elements of the queue are to be stored, if it is big enough;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheTesting.java
LocalCache<?, ?> cchm = toLocalCache(cache); int size = 0; for (Segment<?, ?> segment : cchm.segments) { size += accessQueueSize(segment); } return size; } static int accessQueueSize(Segment<?, ?> segment) { return segment.accessQueue.size(); } static int expirationQueueSize(Cache<?, ?> cache) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 16.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/SupplementalMonitorTest.java
import java.util.concurrent.atomic.AtomicReference; import junit.framework.TestCase; /** * Supplemental tests for {@link Monitor}. * * <p>This test class contains various test cases that don't fit into the test case generation in * {@link GeneratedMonitorTest}. * * @author Justin T. Sampson */ public class SupplementalMonitorTest extends TestCase { public void testLeaveWithoutEnterThrowsIMSE() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 4.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
*/ ImmutableList<E> subListUnchecked(int fromIndex, int toIndex) { return new SubList(fromIndex, toIndex - fromIndex); } class SubList extends ImmutableList<E> { final transient int offset; final transient int length; SubList(int offset, int length) { this.offset = offset; this.length = length; } @Override public int size() { return length; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/hash/HashFunction.java
*/ Hasher newHasher(int expectedInputSize); /** * Shortcut for {@code newHasher().putInt(input).hash()}; returns the hash code for the given * {@code int} value, interpreted in little-endian byte order. The implementation <i>might</i> * perform better than its longhand equivalent, but should not perform worse. * * @since 12.0 */ HashCode hashInt(int input); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0)