- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 79 for drop (0.16 sec)
-
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
// collect drop list for (MetadataGraphVertex v : g.getVertices()) { if (!visited.contains(v)) { dropList.add(v); } } if (dropList.size() < 1) { return g; } // now - drop vertices TreeSet<MetadataGraphVertex> vertices = g.getVertices();
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MapRetrievalCache.java
} private void addToCache(K key, V value) { addToCache(new CacheEntry<K, V>(key, value)); } private void addToCache(CacheEntry<K, V> entry) { // Slide new entry into first cache position. Drop previous entry in second cache position. cacheEntry2 = cacheEntry1; cacheEntry1 = entry; } private static final class CacheEntry<K, V> { final K key; final V value;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
} static double select(int k, double[] array) { // This is basically a copy of com.google.math.Rank#select, with a small change in the method // signature: we make k 0-based rather than 1-based; and we drop from and to, and always work on // the whole array. int from = 0; int to = array.length - 1; while (true) { if (to <= from + 1) { // Two or less elements left.
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
} static double select(int k, double[] array) { // This is basically a copy of com.google.math.Rank#select, with a small change in the method // signature: we make k 0-based rather than 1-based; and we drop from and to, and always work on // the whole array. int from = 0; int to = array.length - 1; while (true) { if (to <= from + 1) { // Two or less elements left.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
@ElementTypesAreNonnullByDefault class CompactLinkedHashMap<K extends @Nullable Object, V extends @Nullable Object> extends CompactHashMap<K, V> { // TODO(lowasser): implement removeEldestEntry so this can be used as a drop-in replacement /** Creates an empty {@code CompactLinkedHashMap} instance. */ public static <K extends @Nullable Object, V extends @Nullable Object> CompactLinkedHashMap<K, V> create() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
// in the opposite order from how they were added so we need to reverse the list to fulfill our // contract. // This is somewhat annoying, but turns out to be very fast in practice. Alternatively, we could // drop the contract on the method that enforces this queue like behavior since depending on it // is likely to be a bug anyway. // N.B. All writes to the list and the next pointers must have happened before the above
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelBuilder.java
try { VersionRange parentRange = versionParser.parseVersionRange(parent.getVersion()); if (!parentRange.contains(versionParser.parseVersion(version))) { // version skew drop back to resolution from the repository return null; } // Validate versions aren't inherited when using parent ranges the same way as when read externally.
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri May 03 08:48:38 GMT 2024 - 61.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
@ElementTypesAreNonnullByDefault class CompactLinkedHashMap<K extends @Nullable Object, V extends @Nullable Object> extends CompactHashMap<K, V> { // TODO(lowasser): implement removeEldestEntry so this can be used as a drop-in replacement /** Creates an empty {@code CompactLinkedHashMap} instance. */ public static <K extends @Nullable Object, V extends @Nullable Object> CompactLinkedHashMap<K, V> create() {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
@ElementTypesAreNonnullByDefault class CompactHashMap<K extends @Nullable Object, V extends @Nullable Object> extends AbstractMap<K, V> implements Serializable { /* * TODO: Make this a drop-in replacement for j.u. versions, actually drop them in, and test the * world. Figure out what sort of space-time tradeoff we're actually going to get here with the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
src/main/java/jcifs/smb1/netbios/NameServiceClient.java
thread.setDaemon( true ); thread.start(); } } void tryClose() { synchronized( LOCK ) { /* Yes, there is the potential to drop packets * because we might close the socket during a * request. However the chances are slim and the * retry code should ensure the overall request
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 17.4K bytes - Viewed (0)