- Sort Score
- Num 10 results
- Language All
Results 71 - 80 of 114 for fastest (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/test/java/jcifs/DialectVersionTest.java
import org.junit.jupiter.params.provider.EnumSource; /** * Test class for DialectVersion functionality */ @DisplayName("DialectVersion Tests") class DialectVersionTest extends BaseTest { @Test @DisplayName("Should define all SMB dialect versions") void testDialectVersionConstants() { // Verify all major SMB versions are defined assertNotNull(DialectVersion.SMB1);Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 7.1K bytes - Click Count (0) -
api/maven-api-model/src/main/java/org/apache/maven/api/model/ModelObjectProcessor.java
* * <p>This service allows implementations to:</p> * <ul> * <li>Pool identical objects to reduce memory footprint</li> * <li>Intern objects for faster equality comparisons</li> * <li>Apply custom optimization strategies</li> * <li>Transform or modify objects during building</li> * </ul> *
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Mon Sep 29 14:45:25 GMT 2025 - 4.3K bytes - Click Count (0) -
docs/debugging/hash-set/main.go
// This function currently supports // - SIPMOD func sipHashMod(key string, cardinality int, id [16]byte) int { if cardinality <= 0 { return -1 } // use the faster version as per siphash docs // https://github.com/dchest/siphash#usage k0, k1 := binary.LittleEndian.Uint64(id[0:8]), binary.LittleEndian.Uint64(id[8:16]) sum64 := siphash.Hash(k0, k1, []byte(key))
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Mon Sep 19 18:05:16 GMT 2022 - 3.7K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/session/Smb2SessionSetupRequestTest.java
import org.junit.jupiter.params.provider.ValueSource; import org.mockito.junit.jupiter.MockitoExtension; import org.mockito.junit.jupiter.MockitoSettings; import org.mockito.quality.Strictness; import jcifs.BaseTest; import jcifs.CIFSContext; import jcifs.Configuration; import jcifs.internal.smb2.ServerMessageBlock2; import jcifs.internal.smb2.ServerMessageBlock2Request; import jcifs.internal.smb2.Smb2Constants;
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 21.2K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/CertificatePinner.kt
* [HTTP Public Key Pinning (HPKP)][rfc_7469] or SHA-1 base64 hashes as in Chromium's * [static certificates][static_certificates]. * * ## Setting up Certificate Pinning * * The easiest way to pin a host is turn on pinning with a broken configuration and read the * expected configuration when the connection fails. Be sure to do this on a trusted network, and
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Wed Mar 19 19:25:20 GMT 2025 - 14.1K bytes - Click Count (1) -
src/test/java/jcifs/internal/smb2/io/Smb2ReadResponseTest.java
import org.junit.jupiter.api.Test; import org.junit.jupiter.params.ParameterizedTest; import org.junit.jupiter.params.provider.CsvSource; import org.junit.jupiter.params.provider.ValueSource; import jcifs.BaseTest; import jcifs.Configuration; import jcifs.internal.SMBProtocolDecodingException; import jcifs.internal.smb2.ServerMessageBlock2; import jcifs.internal.smb2.ServerMessageBlock2Response;
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 22.1K bytes - Click Count (0) -
guava/src/com/google/common/primitives/Floats.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(float[] array, int distance) {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 25.6K bytes - Click Count (0) -
guava/src/com/google/common/primitives/Doubles.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(double[] array, int distance) {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 27.6K bytes - Click Count (0) -
guava/src/com/google/common/primitives/UnsignedInteger.java
import org.jspecify.annotations.Nullable; /** * A wrapper class for unsigned {@code int} values, supporting arithmetic operations. * * <p>In some cases, when speed is more important than code readability, it may be faster simply to * treat primitive {@code int} values as unsigned, using the methods from {@link UnsignedInts}. * * <p>See the Guava User Guide article on <aCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 8.3K bytes - Click Count (0) -
guava/src/com/google/common/primitives/UnsignedLong.java
import org.jspecify.annotations.Nullable; /** * A wrapper class for unsigned {@code long} values, supporting arithmetic operations. * * <p>In some cases, when speed is more important than code readability, it may be faster simply to * treat primitive {@code long} values as unsigned, using the methods from {@link UnsignedLongs}. * * <p>See the Guava User Guide article on <aCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Jun 04 13:03:16 GMT 2025 - 8.8K bytes - Click Count (0)