- Sort Score
- Result 10 results
- Languages All
Results 1221 - 1230 of 1,248 for Invalid (0.05 sec)
-
cmd/metacache-entries.go
selected = entry continue } // Get new entry metadata, // shallow decode. xl, err := entry.xlmeta() if err != nil { continue } objsValid++ // Add all valid to candidates. r.candidates = append(r.candidates, xl.versions) // We select the first object we find as a candidate and see if all match that. // This is to quickly identify if all agree. if selected == nil {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Aug 08 15:29:58 UTC 2024 - 24.1K bytes - Viewed (0) -
README.md
| Dashboard | Creating a bucket |
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 18.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
private static <T extends @Nullable Object> void slowRemoveIfForRemainingElements( List<T> list, Predicate<? super T> predicate, int to, int from) { // Here we know that: // * (to < from) and that both are valid indices. // * Everything with (index < to) should be kept. // * Everything with (to <= index < from) should be removed. // * The element with (index == from) should be kept.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 43.6K bytes - Viewed (0) -
docs/en/docs/alternatives.md
Another big feature needed by APIs is data validation, making sure that the data is valid, given certain parameters. For example, that some field is an `int`, and not some random string. This is especially useful for incoming data. Without a data validation system, you would have to do all the checks by hand, in code.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
int numHashFunctions, LockFreeBitArray bits); /** * Identifier used to encode this strategy, when marshalled as part of a BloomFilter. Only * values in the [-128, 127] range are valid for the compact serial form. Non-negative values * are reserved for enums defined in BloomFilterStrategies; negative values are reserved for any
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 31 13:15:26 UTC 2025 - 26.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
assertTrue( LongMath.biggestBinomials[k] == Integer.MAX_VALUE || !fitsInLong(BigIntegerMath.binomial(LongMath.biggestBinomials[k] + 1, k))); // In the first case, any long is valid; in the second, we want to test that the next-bigger // long overflows. } int k = LongMath.biggestBinomials.length; assertFalse(fitsInLong(BigIntegerMath.binomial(2 * k, k)));
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 31.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/DoublesTest.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 30.9K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/internal/cache/DiskLruCacheTest.kt
} // Test valid cases. // Exactly 120. key = ( "0123456789012345678901234567890123456789012345678901234567890123456789" + "01234567890123456789012345678901234567890123456789" ) cache.edit(key)!!.abort() // Contains all valid characters. key = "abcdefghijklmnopqrstuvwxyz_0123456789" cache.edit(key)!!.abort()
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 75.7K bytes - Viewed (0) -
tests/preload_suits_test.go
t.Error(err) } levelB1 := &LevelB1{Value: "foo"} if err := DB.Create(levelB1).Error; err != nil { t.Error(err) } levelB3 := &LevelB3{ Value: "bar", LevelB1ID: sql.NullInt64{Valid: true, Int64: int64(levelB1.ID)}, LevelB2s: []*LevelB2{}, } if err := DB.Create(levelB3).Error; err != nil { t.Error(err) } levelB1.LevelB3s = []*LevelB3{levelB3} want := []*LevelB1{levelB1}
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Thu Jun 05 11:34:13 UTC 2025 - 30.4K bytes - Viewed (0) -
api/maven-api-model/src/main/mdo/maven.mdo
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Thu Aug 07 14:32:16 UTC 2025 - 132.7K bytes - Viewed (0)