- Sort Score
- Num 10 results
- Language All
Results 281 - 290 of 642 for hold (0.02 seconds)
-
android/guava/src/com/google/common/reflect/TypeResolver.java
* new TypeVariable _will_ be equal to is an equivalent TypeVariable that was also created * by us. And that equality is guaranteed to hold because it doesn't involve the JDK * TypeVariable implementation at all. * * NOTE: b/147144588 - Custom TypeVariables created by Guava do not preserveCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 23 22:30:05 GMT 2025 - 25.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/HashBiMap.java
int expectedSize) { return new HashBiMap<>(expectedSize); } /** * Constructs a new bimap containing initial values from {@code map}. The bimap is created with an * initial capacity sufficient to hold the mappings in the specified map. */ public static <K extends @Nullable Object, V extends @Nullable Object> HashBiMap<K, V> create( Map<? extends K, ? extends V> map) { HashBiMap<K, V> bimap = create(map.size());Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 25.7K bytes - Click Count (0) -
gradle/wrapper/gradle-wrapper.jar
obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS META-INF/MANIFEST.MF Manifest-Version: 1.0 Implementation-Title:...
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Wed Mar 04 20:34:40 GMT 2026 - 47.8K bytes - Click Count (1) -
android/guava/src/com/google/common/collect/ImmutableBiMap.java
} /** * Returns the empty bimap. * * <p><b>Performance note:</b> the instance returned is a singleton. */ // Casting to any type is safe because the set will never hold any elements. @SuppressWarnings("unchecked") public static <K, V> ImmutableBiMap<K, V> of() { return (ImmutableBiMap<K, V>) RegularImmutableBiMap.EMPTY; }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 22.2K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Tables.java
* weak, or phantom references. * * @param backingMap place to store the mapping from each row key to its corresponding column key * / value map * @param factory supplier of new, empty maps that will each hold all column key / value mappings * for a given row key * @throws IllegalArgumentException if {@code backingMap} is not empty * @since 10.0 */ public static <R, C, V> Table<R, C, V> newCustomTable(Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 24.9K bytes - Click Count (0) -
src/main/java/jcifs/Configuration.java
*/ int getMaxRequestRetries(); /** * Property {@code jcifs.smb.client.strictResourceLifecycle} (bool, default false) * * If enabled, SmbFile instances starting with their first use will hold a reference to their tree. * This means that trees/sessions/connections won't be idle-disconnected even if there are no other active * references (currently executing code, file descriptors). *Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 25.4K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
LinkedListMultimap<K, V> create() { return new LinkedListMultimap<>(); } /** * Constructs an empty {@code LinkedListMultimap} with enough capacity to hold the specified * number of keys without rehashing. * * @param expectedKeys the expected number of distinct keys * @throws IllegalArgumentException if {@code expectedKeys} is negative */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 26.6K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
/** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. Always returns at least setSize + 2. */ @VisibleForTesting static int chooseTableSize(int setSize) { setSize = max(setSize, 2);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Oct 11 14:54:00 GMT 2025 - 22.4K bytes - Click Count (0) -
cmd/object-api-errors.go
} // PreConditionFailed - Check if copy precondition failed type PreConditionFailed struct{} func (e PreConditionFailed) Error() string { return "At least one of the pre-conditions you specified did not hold" } func isErrPreconditionFailed(err error) bool { _, ok := err.(PreConditionFailed) return ok } // isErrMethodNotAllowed - Check if error type is MethodNotAllowed.Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 09 02:05:14 GMT 2024 - 22.1K bytes - Click Count (0) -
src/bytes/buffer.go
} return copy(b.buf[m:], s), nil } // MinRead is the minimum slice size passed to a [Buffer.Read] call by // [Buffer.ReadFrom]. As long as the [Buffer] has at least MinRead bytes beyond // what is required to hold the contents of r, [Buffer.ReadFrom] will not grow the // underlying buffer. const MinRead = 512 // ReadFrom reads data from r until EOF and appends it to the buffer, growing
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Nov 14 19:01:17 GMT 2025 - 16.5K bytes - Click Count (0)