- Sort Score
- Result 10 results
- Languages All
Results 531 - 540 of 933 for Second (0.06 sec)
-
helm-releases/minio-3.3.1.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} ls myminio/$BUCKET...
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Dec 02 20:09:18 UTC 2021 - 14.6K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.18.md
- Fix: use force detach for azure disk ([#91948](https://github.com/kubernetes/kubernetes/pull/91948), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider] - Fixes a problem with 63-second or 1-second connection delays with some VXLAN-based network plugins which was first widely noticed in 1.16 (though some users saw it earlier than that, possibly only with specific network plugins). If you were previously
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Wed Jun 16 17:18:28 UTC 2021 - 373.2K bytes - Viewed (0) -
guava/src/com/google/common/net/InetAddresses.java
} ByteBuffer rawBytes = ByteBuffer.allocate(2 * IPV6_PART_COUNT); try { // Iterate through the parts of the ip string. // Invariant: start is always the beginning of a hextet, or the second ':' of the skip // sequence "::" int start = 0; if (ipString.charAt(0) == IPV6_DELIMITER) { start = 1; } while (start < ipString.length()) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 47.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use the * equivalent {@link Long#compare} method instead. * * @param a the first {@code long} to compare * @param b the second {@code long} 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 */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 29.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Longs.java
* * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use the * equivalent {@link Long#compare} method instead. * * @param a the first {@code long} to compare * @param b the second {@code long} 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 */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 29K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Files.java
* written into the directory. * * <p>This method assumes that the temporary volume is writable, has free inodes and free blocks, * and that it will not be called thousands of times per second. * * <p><b>{@link java.nio.file.Path} equivalent:</b> {@link * java.nio.file.Files#createTempDirectory}. * * @return the newly-created directory
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jul 22 19:03:12 UTC 2024 - 33.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
// If we are looking for the least element in the range, we can just do a linear search for it. // (We will hit this whenever we are doing quantile interpolation: our first selection finds // the lower value, our second one finds the upper value by looking for the next least element.) if (required == from) { int min = from; for (int index = from + 1; index <= to; index++) { if (array[min] > array[index]) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/io/Files.java
* written into the directory. * * <p>This method assumes that the temporary volume is writable, has free inodes and free blocks, * and that it will not be called thousands of times per second. * * <p><b>{@link java.nio.file.Path} equivalent:</b> {@link * java.nio.file.Files#createTempDirectory}. * * @return the newly-created directory
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jul 22 19:03:12 UTC 2024 - 33.1K bytes - Viewed (0) -
cmd/admin-handlers-users.go
} if createReq.Expiration != nil && !createReq.Expiration.IsZero() { // truncate expiration at the second. truncateTime := createReq.Expiration.Truncate(time.Second) createReq.Expiration = &truncateTime } // service account access key cannot have space characters beginning and end of the string. if hasSpaceBE(createReq.AccessKey) {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Oct 03 23:11:02 UTC 2024 - 85.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Ordering.java
/** * Returns an ordering which first uses the ordering {@code this}, but which in the event of a * "tie", then delegates to {@code secondaryComparator}. For example, to sort a bug list first by * status and second by priority, you might use {@code byStatus.compound(byPriority)}. For a * compound ordering with three or more components, simply chain multiple calls to this method. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.4K bytes - Viewed (0)