- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 1,092 for Chan (0.5 sec)
-
internal/config/storageclass/storage-class.go
// SS parity drives should be greater than or equal to minParityDrives. // Parity below minParityDrives is not supported. if ssParity > 0 && ssParity < minParityDrives { return fmt.Errorf("parity %d should be greater than or equal to %d", ssParity, minParityDrives) } if ssParity > setDriveCount/2 { return fmt.Errorf("parity %d should be less than or equal to %d", ssParity, setDriveCount/2) }
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 12.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
} /** * Returns {@code true} if each element in {@code iterable} after the first is greater than or * equal to the element that preceded it, according to the specified comparator. Note that this is * always true when the iterable has fewer than two elements. */ public static <T extends @Nullable Object> boolean isInOrder( Iterable<? extends T> iterable, Comparator<T> comparator) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
tests/test_tutorial/test_body_fields/test_tutorial001.py
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Dec 27 18:19:10 UTC 2025 - 6.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* perform better than its longhand equivalent, but should not perform worse. * * @since 12.0 */ HashCode hashInt(int input); /** * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* perform better than its longhand equivalent, but should not perform worse. * * @since 12.0 */ HashCode hashInt(int input); /** * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 10.9K bytes - Viewed (0) -
tests/test_tutorial/test_path_params_numeric_validations/test_tutorial006.py
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Fri Dec 26 10:43:02 UTC 2025 - 7.3K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/internal/ws/WebSocketWriterTest.kt
"Payload size must be less than or equal to 125", ) } } @Test fun pongTooLongThrows() { assertFailsWith<IllegalArgumentException> { serverWriter.writePong((binaryData(1000))) }.also { expected -> assertThat(expected.message).isEqualTo( "Payload size must be less than or equal to 125", ) } }
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 9.3K bytes - Viewed (0) -
internal/event/errors.go
} // ErrFilterNamePrefix - more than one prefix usage error. type ErrFilterNamePrefix struct{} func (err ErrFilterNamePrefix) Error() string { return "more than one prefix in filter rule" } // ErrFilterNameSuffix - more than one suffix usage error. type ErrFilterNameSuffix struct{} func (err ErrFilterNameSuffix) Error() string { return "more than one suffix in filter rule" }Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Jun 01 21:59:40 UTC 2021 - 4.1K bytes - Viewed (0) -
cmd/batch-replicate_test.go
# - configurable retries for the job (each retry skips successfully previously replaced objects) flags: filter: newerThan: "7d10h31s" # match objects newer than this value (e.g. 7d10h31s) olderThan: "7d" # match objects older than this value (e.g. 7d10h31s) # createdAfter: "date" # match objects created after "date" # createdBefore: "date" # match objects created before "date"
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Aug 01 12:53:30 UTC 2024 - 7.9K bytes - Viewed (0) -
cmd/dynamic-timeouts_test.go
for range dynamicTimeoutLogSize { timeout.LogFailure() } adjusted := timeout.Timeout() if initial >= adjusted { t.Errorf("Failure to increase timeout, expected %v to be more than %v", adjusted, initial) } } func TestDynamicTimeoutDualIncrease(t *testing.T) { timeout := newDynamicTimeout(time.Minute, time.Second) initial := timeout.Timeout() for range dynamicTimeoutLogSize {Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 5.2K bytes - Viewed (0)