- Sort Score
- Result 10 results
- Languages All
Results 251 - 260 of 876 for Orders (0.05 sec)
-
regression-test/build.gradle.kts
} android { compileSdk = 35 namespace = "okhttp.android.regression" defaultConfig { minSdk = 21 targetSdk = 34 // Make sure to use the AndroidJUnitRunner (or a sub-class) in order to hook in the JUnit 5 Test Builder testInstrumentationRunner = "androidx.test.runner.AndroidJUnitRunner" testInstrumentationRunnerArguments += mapOf(Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Mon Mar 17 15:11:24 UTC 2025 - 1.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* an application-specified ordering of lock acquisitions. The application defines the allowed * ordering with an {@code Enum} whose values each correspond to a lock type. The order in which * the values are declared dictates the allowed order of lock acquisition. In other words, locks * corresponding to smaller values of {@link Enum#ordinal()} should only be acquired before locks * with larger ordinals. Example: *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 11 17:06:34 UTC 2025 - 35.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/MutableNetwork.java
* silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph. * * <p>If {@code edge} already connects {@code nodeU} to {@code nodeV} (in the specified order if * this network {@link #isDirected()}, else in any order), then this method will have no effect. * * @return {@code true} if the network was modified as a result of this callRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 4.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultisetTest.java
protected Multiset<String> create(String[] elements) { return TreeMultiset.create(asList(elements)); } @Override public List<String> order(List<String> insertionOrder) { return Ordering.natural().sortedCopy(insertionOrder); } }) .withFeatures( CollectionSize.ANY,
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 13K bytes - Viewed (0) -
docs/en/data/translators.yml
url: https://github.com/AlertRED hard-coders: login: hard-coders count: 15 avatarUrl: https://avatars.githubusercontent.com/u/9651103?u=95db33927bbff1ed1c07efddeb97ac2ff33068ed&v=4 url: https://github.com/hard-coders Joao-Pedro-P-Holanda: login: Joao-Pedro-P-Holanda count: 14
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Mon Dec 01 06:27:43 UTC 2025 - 19.3K bytes - Viewed (0) -
cmd/sftp-server.go
var globalSFTPTrustedCAPubkey ssh.PublicKey // https://cs.opensource.google/go/x/crypto/+/refs/tags/v0.22.0:ssh/common.go;l=46 // preferredKexAlgos specifies the default preference for key-exchange // algorithms in preference order. The diffie-hellman-group16-sha512 algorithm // is disabled by default because it is a bit slower than the others. var preferredKexAlgos = []string{ kexAlgoCurve25519SHA256, kexAlgoCurve25519SHA256LibSSH,Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 16.5K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Floats.java
@Override public String toString() { return "Floats.lexicographicalComparator()"; } } /** * Sorts the elements of {@code array} in descending order. * * <p>Note that this method uses the total order imposed by {@link Float#compare}, which treats * all NaN values as equal and 0.0 as greater than -0.0. * * @since 23.1 */ public static void sortDescending(float[] array) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 25.6K bytes - Viewed (0) -
internal/handlers/proxy.go
var enableXFFHeader = env.Get("_MINIO_API_XFF_HEADER", config.EnableOn) == config.EnableOn // GetSourceScheme retrieves the scheme from the X-Forwarded-Proto and RFC7239 // Forwarded headers (in that order). func GetSourceScheme(r *http.Request) string { var scheme string // Retrieve the scheme from X-Forwarded-Proto. if proto := r.Header.Get(xForwardedProto); proto != "" { scheme = strings.ToLower(proto)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Wed Feb 26 19:25:49 UTC 2025 - 5.4K bytes - Viewed (0) -
src/test/java/jcifs/smb/BufferCacheImplTest.java
} // Capacity behavior: when full, additional releases are dropped; only cached buffers are returned @Test @DisplayName("Cache capacity respected: extra releases dropped; retrieval order by first free slot") void cacheCapacityAndRetrievalOrder() { BufferCacheImpl impl = new BufferCacheImpl(2, 3); byte[] a = new byte[1]; byte[] c = new byte[2]; byte[] d = new byte[4];Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 7.5K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/concurrent/TaskQueue.kt
package okhttp3.internal.concurrent import java.util.concurrent.CountDownLatch import java.util.concurrent.RejectedExecutionException import okhttp3.internal.okHttpName /** * A set of tasks that are executed in sequential order. * * Work within queues is not concurrent. This is equivalent to each queue having a dedicated thread * for its work; in practice a set of queues may share a set of threads to save resources. */
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed May 28 23:28:25 UTC 2025 - 7.3K bytes - Viewed (0)