- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 287 for Noop (0.03 seconds)
-
helm-releases/minio-3.6.4.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...Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Apr 12 01:30:28 GMT 2022 - 17.9K bytes - Click Count (0) -
src/archive/tar/reader.go
// files. Internally, the tar format often uses fake "files" to add meta // data that describes the next file. These meta data "files" should not // normally be visible to the outside. As such, this loop iterates through // one or more "header files" until it finds a "normal file". format := FormatUSTAR | FormatPAX | FormatGNU for { // Discard the remainder of the file and any padding.
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Oct 07 19:46:36 GMT 2025 - 26.9K bytes - Click Count (0) -
helm-releases/minio-3.6.2.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...Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Mar 17 18:30:55 GMT 2022 - 17.9K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/io/CharStreamsTest.java
* is permanently reduced, but with certain Reader implementations it could also cause the buffer * size to reach 0, causing an infinite loop. */ @SuppressWarnings("InlineMeInliner") // String.repeat unavailable under Java 8 public void testCopyWithReaderThatDoesNotFillBuffer() throws IOException {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 16:03:47 GMT 2025 - 11.3K bytes - Click Count (0) -
guava-tests/test/com/google/common/io/CharStreamsTest.java
* is permanently reduced, but with certain Reader implementations it could also cause the buffer * size to reach 0, causing an infinite loop. */ @SuppressWarnings("InlineMeInliner") // String.repeat unavailable under Java 8 public void testCopyWithReaderThatDoesNotFillBuffer() throws IOException {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 16:03:47 GMT 2025 - 11.3K bytes - Click Count (0) -
internal/http/listener_test.go
nonLoopBackIPs := localIP4.FuncMatch(func(ip string, matchString string) bool { return !strings.HasPrefix(ip, "127.") }, "") if len(nonLoopBackIPs) == 0 { t.Fatalf("No non-loop back IP address found for this host") } nonLoopBackIP := nonLoopBackIPs.ToSlice()[0] return nonLoopBackIP } func TestNewHTTPListener(t *testing.T) { testCases := []struct {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 11.8K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/GraphsTest.java
IllegalArgumentException e = assertThrows(IllegalArgumentException.class, () -> directedGraph.addEdge(N1, N2, E12_A)); assertThat(e).hasMessageThat().contains(ERROR_PARALLEL_EDGE); // By default, self-loop edges are not allowed. e = assertThrows(IllegalArgumentException.class, () -> directedGraph.addEdge(N1, N1, E11)); assertThat(e).hasMessageThat().contains(ERROR_SELF_LOOP); } @TestCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 30.1K bytes - Click Count (0) -
internal/dsync/drwmutex.go
isReadLock := true return dm.lockBlocking(ctx, cancel, id, source, isReadLock, opts) } // lockBlocking will try to acquire either a read or a write lock // // The function will loop using a built-in timing randomized back-off // algorithm until either the lock is acquired successfully or more // time has elapsed than the timeout value.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 20.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
CompactHashing.tableSet(newTable, targetHash & newMask, targetEntryIndex + 1); } Object oldTable = requireTable(); int[] entries = requireEntries(); // Loop over `oldTable` to construct its replacement, ``newTable`. The entries do not move, so // the `keys` and `values` arrays do not need to change. But because the "short hash" now has a
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/ForwardingMap.java
* #remove} to forward to this implementation. * * <p>Alternately, you may wish to override {@link #remove} with {@code keySet().remove}, assuming * that approach would not lead to an infinite loop. * * @since 7.0 */ protected @Nullable V standardRemove(@Nullable Object key) { Iterator<Entry<K, V>> entryIterator = entrySet().iterator(); while (entryIterator.hasNext()) {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 17:32:30 GMT 2025 - 9.8K bytes - Click Count (0)