- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 401 for Vless (0.14 sec)
-
okhttp/src/main/kotlin/okhttp3/internal/ws/WebSocketExtensions.kt
* `server_max_window_bits`. This harms our ability to support these parameters: * * * If `client_max_window_bits` is less than 15, OkHttp must close the web socket with code 1010. * Otherwise it would compress values in a way that servers could not decompress. * * If `server_max_window_bits` is less than 15, OkHttp will waste memory on an oversized buffer. * * See [RFC 7692, 7.1][rfc_7692] for details on negotiation process. *
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.1K bytes - Viewed (0) -
docs/en/docs/how-to/index.md
# How To - Recipes Here you will see different recipes or "how to" guides for **several topics**. Most of these ideas would be more or less **independent**, and in most cases you should only need to study them if they apply directly to **your project**. If something seems interesting and useful to your project, go ahead and check it, but otherwise, you might probably just skip them. !!! tip
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Sat Aug 19 19:54:04 GMT 2023 - 591 bytes - Viewed (0) -
cmd/sts-datatypes.go
// // Note: The size of the security token that STS APIs return is not fixed. We // strongly recommend that you make no assumptions about the maximum size. As // of this writing, the typical size is less than 4096 bytes, but that can vary. // Also, future updates to AWS might require larger sizes. Credentials auth.Credentials `xml:",omitempty"` // A percentage value that indicates the size of the policy in packed form.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 27 00:58:09 GMT 2022 - 9.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* part of the smeared hash of the element not covered by the hashtable mask, whereas the low bits * are the "next" pointer (pointing to the next entry in the bucket chain), which will always be * less than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff * next = 00000bbb * entry = aaaaabbb * </pre> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* are processed in FIFO order; if {@code false} the access order is unspecified. * @param c the collection of elements to initially contain * @throws IllegalArgumentException if {@code capacity} is less than {@code c.size()}, or less * than 1. * @throws NullPointerException if the specified collection or any of its elements are null */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* are processed in FIFO order; if {@code false} the access order is unspecified. * @param c the collection of elements to initially contain * @throws IllegalArgumentException if {@code capacity} is less than {@code c.size()}, or less * than 1. * @throws NullPointerException if the specified collection or any of its elements are null */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* world. Figure out what sort of space-time tradeoff we're actually going to get here with the * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in * less allocation, but also having the GC do less work to scan the heap because of fewer * references, which is particularly hard to quantify. */ /** Creates an empty {@code CompactHashMap} instance. */
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) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/OldestConflictResolver.java
import org.apache.maven.artifact.versioning.OverConstrainedVersionException; /** * Resolves conflicting artifacts by always selecting the oldest declaration. Oldest is defined as the * declaration whose version is less according to <code>ArtifactVersion.compareTo</code>. * * @see ArtifactVersion#compareTo * @since 3.0 */ @Named("oldest") @Singleton @Deprecated public class OldestConflictResolver implements ConflictResolver {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/ServiceTest.java
assertLessThan(STOPPING, TERMINATED); } private static <T extends Comparable<? super T>> void assertLessThan(T a, T b) { if (a.compareTo(b) >= 0) { fail(String.format(Locale.ROOT, "Expected %s to be less than %s", a, b)); } }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 1.9K bytes - Viewed (0)