- Sort Score
- Num 10 results
- Language All
Results 561 - 570 of 838 for scond (0.02 seconds)
-
cmd/erasure-server-pool-rebalance.go
// to avoid multiple pool leaders herding to update around the same // time. r := rand.New(rand.NewSource(time.Now().UnixNano())) randSleepFor := func() time.Duration { return 5*time.Second + time.Duration(float64(5*time.Second)*r.Float64()) } timer := time.NewTimer(randSleepFor()) defer timer.Stop() var ( quit bool traceMsg string
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 28.7K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Multisets.java
} /** * Returns an unmodifiable view of the difference of two multisets. In the returned multiset, the * count of each element is the result of the <i>zero-truncated subtraction</i> of its count in * the second multiset from its count in the first multiset, with elements that would have a count * of 0 not included. The iteration order of the returned multiset matches that of the element set
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 41.3K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Ints.java
* <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use the * equivalent {@link Integer#compare} method instead. * * @param a the first {@code int} to compare * @param b the second {@code int} to compare * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is * greater than {@code b}; or zero if they are equal */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 16:45:58 GMT 2026 - 31.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/Multisets.java
} /** * Returns an unmodifiable view of the difference of two multisets. In the returned multiset, the * count of each element is the result of the <i>zero-truncated subtraction</i> of its count in * the second multiset from its count in the first multiset, with elements that would have a count * of 0 not included. The iteration order of the returned multiset matches that of the element set
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 41.2K bytes - Click Count (0) -
src/test/java/jcifs/netbios/SessionServicePacketTest.java
void testReadnMultipleCalls() throws IOException { when(mockInputStream.read(any(byte[].class), anyInt(), anyInt())).thenReturn(2) // First read returns 2 bytes .thenReturn(2) // Second read returns 2 bytes .thenReturn(1); // Third read returns 1 byte byte[] buffer = new byte[10]; int bytesRead = SessionServicePacket.readn(mockInputStream, buffer, 0, 5);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.5K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/ioctl/SrvCopyChunkCopyResponseTest.java
assertEquals(1, response.getChunksWritten()); assertEquals(1024, response.getChunkBytesWritten()); assertEquals(1024, response.getTotalBytesWritten()); // Second decode - should update values byte[] buffer2 = createValidCopyChunkResponse(5, 8192, 40960); response.decode(buffer2, 0, buffer2.length); assertEquals(5, response.getChunksWritten());
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 19.8K bytes - Click Count (0) -
mockwebserver/src/main/kotlin/mockwebserver3/MockWebServer.kt
): RecordedRequest? = requestQueue.poll(timeout, unit) /** * Scripts [response] to be returned to a request made in sequence. The first request is * served by the first enqueued response; the second request by the second enqueued response; and * so on. * * @throws ClassCastException if the default dispatcher has been * replaced with [setDispatcher][dispatcher]. */
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Jan 27 09:00:39 GMT 2026 - 40.3K bytes - Click Count (0) -
cmd/notification.go
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 46K bytes - Click Count (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
// If duplicates are allowed, this IdentityHashMap will record the final Entry for each // duplicated key. We will use this final Entry to overwrite earlier slots in the entries array // that have the same key. Then a second pass will remove all but the first of the slots that // have this Entry. The value in the map becomes false when this first entry has been copied, so // we know not to copy the remaining ones.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 15.7K bytes - Click Count (0) -
helm-releases/minio-5.0.6.tgz
myminio $SCHEME://$MINIO_ENDPOINT:$MINIO_PORT $ACCESS $SECRET" ; $MC_COMMAND ; STATUS=$? ; until [ $STATUS = 0 ] do ATTEMPTS=`expr $ATTEMPTS + 1` ; echo \"Failed attempts: $ATTEMPTS\" ; if [ $ATTEMPTS -gt $LIMIT ]; then exit 1 ; fi ; sleep 2 ; # 1 second intervals between attempts $MC_COMMAND ; STATUS=$? ; done ; set -e ; # reset `e` as active return 0 } # checkBucketExists ($bucket) # Check if the bucket exists, by using the exit code of `mc ls` checkBucketExists() { BUCKET=$1 CMD=$(${MC} stat myminio/$BUCKET...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Mon Feb 13 06:53:06 GMT 2023 - 20.3K bytes - Click Count (0)