- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 395 for Attempt (0.26 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
cmd/signature-v4-parser_test.go
testCases := []struct { inputSignElement string expectedSignStr string expectedErrCode APIErrorCode }{ // Test case - 1. // SignElement doesn't have 2 parts on an attempt to split at '='. // ErrMissingFields expected. { inputSignElement: "Signature", expectedSignStr: "", expectedErrCode: ErrMissingFields, }, // Test case - 2.Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Oct 10 18:57:35 GMT 2025 - 27.8K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/-UtilJvm.kt
return if (!fieldType.isInstance(value)) null else fieldType.cast(value) } catch (_: NoSuchFieldException) { } c = c.superclass } // Didn't find the field we wanted. As a last gasp attempt, // try to find the value on a delegate. if (fieldName != "delegate") { val delegate = readFieldOrNull(instance, Any::class.java, "delegate")
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 10.3K bytes - Click Count (1) -
src/archive/tar/strconv.go
} return int64(x) } // Normal case is base-8 (octal) format. return p.parseOctal(b) } // formatNumeric encodes x into b using base-8 (octal) encoding if possible. // Otherwise it will attempt to use base-256 (binary) encoding. func (f *formatter) formatNumeric(b []byte, x int64) { if fitsInOctal(len(b), x) { f.formatOctal(b, x) return } if fitsInBase256(len(b), x) {
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Dec 30 15:28:53 GMT 2025 - 9.1K bytes - Click Count (0) -
cmd/encryption-v1.go
return nil, err } mac := hmac.New(sha256.New, key) mac.Write([]byte(baseKey)) return sio.DecryptBuffer(nil, input, sio.Config{Key: mac.Sum(nil)}) } } // decryptPartsChecksums will attempt to decrypt and decode part checksums, and save // only the decrypted part checksum values on ObjectInfo directly. // if part > 0, and we have the checksum for the part that will be returned.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 38K bytes - Click Count (0) -
src/main/java/jcifs/smb/SIDCacheImpl.java
} } } } /** * Resolve an array of SIDs using a cache and at most one MSRPC request. * <p> * This method will attempt * to resolve SIDs using a cache and cache the results of any SIDs that * required resolving with the authority. SID cache entries are currently notCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Mon Aug 25 14:34:10 GMT 2025 - 13.6K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/DcerpcHandleTest.java
class HandleCreationTests { @Test @DisplayName("Should create DcerpcPipeHandle for ncacn_np protocol") void testGetHandleNcacnNpProtocol() { // When/Then: Should attempt to create DcerpcPipeHandle (may fail due to SMB URL creation) // This tests the protocol recognition logic, actual creation may fail due to missing SMB supportCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.3K bytes - Click Count (0) -
android/guava/src/com/google/common/escape/UnicodeEscaper.java
* <li><b>If the character at the specified index is not a surrogate, it is returned.</b> * <li>If the first character was a high surrogate value, then an attempt is made to read the * next character. * <ol> * <li><b>If the end of the sequence was reached, the negated value of the trailing high * surrogate is returned.</b>
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Jan 24 04:06:11 GMT 2026 - 13.2K bytes - Click Count (0) -
Vagrantfile
#{install_command} $1 && break let n=n+1 if [ $n -ge $2 ]; then echo "==> Exhausted retries to install $1" return 1 fi echo "==> Retrying installing $1, attempt $((n+1))" # Add a small delay to increase chance of metalink providing updated list of mirrors sleep 5 done } installed() { command -v $1 2>&1 >/dev/null }Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Wed Feb 17 17:41:23 GMT 2021 - 14.9K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* * <p>A high-quality hash function strives for some subset of the following virtues: * * <ul> * <li><b>collision-resistant:</b> while the definition above requires making at least <i>some</i> * token attempt, one measure of the quality of a hash function is <i>how well</i> it succeeds * at this goal. Important note: it may be easy to achieve the theoretical minimum collision
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
src/test/java/jcifs/smb1/netbios/SocketInputStreamTest.java
// Read the three data bytes assertEquals(1, sis.read()); assertEquals(2, sis.read()); assertEquals(3, sis.read()); // After consuming all data, trying to read again will attempt to read // another packet header, but since there's no more data, it will throw IOException assertThrows(IOException.class, () -> sis.read()); } @TestCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 14.2K bytes - Click Count (0)