- Sort Score
- Num 10 results
- Language All
Results 81 - 90 of 250 for good (0.02 seconds)
-
cmd/postpolicyform_test.go
}, // duplicate '$bucket' reject {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 12.3K bytes - Click Count (0) -
SECURITY.md
If the multitenant design allows sharing models, make sure that tenants and users are aware of the security risks detailed here and that they are going to be practically running code provided by other users. Currently there are no good ways to detect malicious models/graphs/checkpoints, so the recommended way to mitigate the risk in this scenario is to sandbox the model execution. ### Hardware attacks
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Wed Oct 16 16:10:43 GMT 2024 - 9.6K bytes - Click Count (0) -
docs/contribute/concurrency.md
So we have a dedicated thread for every socket that just reads frames and dispatches them.
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Sun Feb 06 16:35:36 GMT 2022 - 7K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a * good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. *Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a * good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. *Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableMultimap.java
* Returns a new builder with a hint for how many distinct keys are expected to be added. The * generated builder is equivalent to that returned by {@link #builder}, but may perform better if * {@code expectedKeys} is a good estimate. * * @throws IllegalArgumentException if {@code expectedKeys} is negative * @since 33.3.0 */ public static <K, V> Builder<K, V> builderWithExpectedKeys(int expectedKeys) {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Dec 09 15:58:48 GMT 2025 - 28.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnection.kt
} if (url.host == routeUrl.host) { return true // Host match. The URL is supported. } // We have a host mismatch. But if the certificate matches, we're still good. return !noCoalescedConnections && handshake != null && certificateSupportHost(url, handshake) } private fun certificateSupportHost( url: HttpUrl, handshake: Handshake, ): Boolean {Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Tue Oct 07 21:55:03 GMT 2025 - 14.6K bytes - Click Count (0) -
docs/en/docs/tutorial/path-params.md
## Pydantic { #pydantic } All the data validation is performed under the hood by <a href="https://docs.pydantic.dev/" class="external-link" target="_blank">Pydantic</a>, so you get all the benefits from it. And you know you are in good hands. You can use the same type declarations with `str`, `float`, `bool` and many other complex data types.Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 20:41:43 GMT 2025 - 9.2K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and * amortized) constant time operations. Expected in the hashtable sense (depends on the hash * function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. *Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 10.2K bytes - Click Count (0) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
} /** * Careful here: if threads are mutating the atomicLongArray while this method is executing, the * final long[] will be a "rolling snapshot" of the state of the bit array. This is usually good * enough, but should be kept in mind. */ public static long[] toPlainArray(AtomicLongArray atomicLongArray) { long[] array = new long[atomicLongArray.length()];Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Jan 08 14:27:16 GMT 2025 - 10.7K bytes - Click Count (0)