- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 56 for loop (0.14 sec)
-
helm-releases/minio-5.2.0.tgz
event of a failed command. {{- if .Values.configPathmc }} MC_CONFIG_DIR="{{ .Values.configPathmc }}" MC="/usr/bin/mc --insecure --config-dir ${MC_CONFIG_DIR}" {{- else }} MC="/usr/bin/mc --insecure" {{- end }} # connectToMinio # Use a check-sleep-check loop to wait for MinIO service to be available connectToMinio() { SCHEME=$1 ATTEMPTS=0 LIMIT=29 # Allow 30 attempts set -e # fail if we can't read the keys. ACCESS=$(cat /config/rootUser) SECRET=$(cat /config/rootPassword) set +e # The connections to minio...
Others - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 10:14:37 GMT 2024 - 21.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. * * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You * should use an explicit {@code break} or be certain that you will eventually remove all the * elements. */ public static <T extends @Nullable Object> Iterator<T> cycle(Iterable<T> iterable) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
* iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. * * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You * should use an explicit {@code break} or be certain that you will eventually remove all the * elements. * * <p>To cycle over the iterable {@code n} times, use the following: {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableList.java
@Deprecated @Override public final ImmutableList<E> asList() { return this; } @Override int copyIntoArray(@Nullable Object[] dst, int offset) { // this loop is faster for RandomAccess instances, which ImmutableLists are int size = size(); for (int i = 0; i < size; i++) { dst[offset + i] = get(i); } return offset + size; } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.1K bytes - Viewed (0) -
cmd/erasure-healing.go
if err != nil { return result, err } } result.ObjectSize, err = latestMeta.ToObjectInfo(bucket, object, true).GetActualSize() if err != nil { return result, err } // Loop to find number of disks with valid data, per-drive // data state and a list of outdated disks on which data needs // to be healed. outDatedDisks := make([]StorageAPI, len(storageDisks)) disksToHealCount := 0
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 33.1K bytes - Viewed (0) -
cmd/erasure-object.go
} written, err := erasure.Decode(ctx, writer, readers, partOffset, partLength, partSize, prefer) // Note: we should not be defer'ing the following closeBitrotReaders() call as // we are inside a for loop i.e if we use defer, we would accumulate a lot of open files by the time // we return from this function. closeBitrotReaders(readers) if err != nil { // If we have successfully written all the content that was asked
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun May 05 16:56:21 GMT 2024 - 77.2K bytes - Viewed (2) -
cmd/data-usage-cache.go
// deleteRecursive will delete an entry recursively, but not change its parent. func (d *dataUsageCache) deleteRecursive(h dataUsageHash) { if existing, ok := d.Cache[h.String()]; ok { // Delete first if there should be a loop. delete(d.Cache, h.Key()) for child := range existing.Children { d.deleteRecursive(dataUsageHash(child)) } } } // dui converts the flattened version of the path to madmin.DataUsageInfo.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 41.4K bytes - Viewed (1) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/diagnostics/KtFirDataClassConverters.kt
firDiagnostic as KtPsiDiagnostic, token, ) } add(FirErrors.BREAK_OR_CONTINUE_OUTSIDE_A_LOOP) { firDiagnostic -> BreakOrContinueOutsideALoopImpl( firDiagnostic as KtPsiDiagnostic, token, ) } add(FirErrors.NOT_A_LOOP_LABEL) { firDiagnostic -> NotALoopLabelImpl( firDiagnostic as KtPsiDiagnostic, token,
Plain Text - Registered: Fri Apr 26 08:18:10 GMT 2024 - Last Modified: Wed Apr 24 09:49:26 GMT 2024 - 208.3K bytes - Viewed (0) -
RELEASE.md
## Known Caveats * TF Core: * A longstanding bug in `tf.while_loop`, which caused it to execute sequentially, even when `parallel_iterations>1`, has now been fixed. However, the increased parallelism may result in increased memory use. Users who experience unwanted regressions should reset their `while_loop`'s `parallel_iterations` value to 1, which is consistent with prior behavior.
Plain Text - Registered: Tue May 07 12:40:20 GMT 2024 - Last Modified: Mon Apr 29 19:17:57 GMT 2024 - 727.7K bytes - Viewed (8) -
cmd/erasure-sets.go
break } } globalLocalDrivesMu.Unlock() } s.erasureDisksMu.Unlock() }(endpoint) } wg.Wait() } // monitorAndConnectEndpoints this is a monitoring loop to keep track of disconnected // endpoints by reconnecting them and making sure to place them into right position in // the set topology, this monitoring happens at a given monitoring interval.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 20:08:20 GMT 2024 - 37.7K bytes - Viewed (5)