Search Options

Results per page
Sort
Preferred Languages
Advance

Results 161 - 170 of 393 for noop (0.24 sec)

  1. cmd/site-replication-utils.go

    	go s.init(ctx)
    	return &s
    }
    
    // init site resync metrics
    func (sm *siteResyncMetrics) init(ctx context.Context) {
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	// Run the site resync metrics load in a loop
    	for {
    		if err := sm.load(ctx, newObjectLayerFn()); err == nil {
    			<-ctx.Done()
    			return
    		}
    		duration := max(time.Duration(r.Float64()*float64(time.Second*10)),
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.8K bytes
    - Viewed (0)
  2. 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...
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Apr 12 01:30:28 UTC 2022
    - 17.9K bytes
    - Viewed (0)
  3. 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.
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 20.3K bytes
    - Viewed (0)
  4. src/cmd/asm/internal/asm/testdata/ppc64_p10.s

    	PDEPD R1, R2, R3                        // 7c231138
    	PEXTD R1, R2, R3                        // 7c231178
    	PLBZ 1234(R1), $0, R3                   // 06000000886104d260000000
    	// Note, PLD crosses a 64B boundary, and a nop is inserted between PLBZ and PLD
    	PLD 1234(R1), $0, R3                    // 04000000e46104d2
    	PLFD 1234(R1), $0, F3                   // 06000000c86104d2
    	PLFS 1234567890(R4), $0, F3             // 06004996c06402d2
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Mar 23 20:52:57 UTC 2023
    - 14.3K bytes
    - Viewed (0)
  5. helm-releases/minio-5.0.6.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...
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Mon Feb 13 06:53:06 UTC 2023
    - 20.3K bytes
    - Viewed (0)
  6. 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
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 39.6K bytes
    - Viewed (0)
  7. fess-crawler/src/main/java/org/codelibs/fess/crawler/entity/AccessResultImpl.java

     */
    public class AccessResultImpl<IDTYPE> implements AccessResult<IDTYPE> {
    
        /**
         * Creates a new instance of AccessResultImpl.
         */
        public AccessResultImpl() {
            // NOP
        }
    
        /** The unique identifier for the access result. */
        protected IDTYPE id;
    
        /** The session ID associated with the access result. */
        protected String sessionId;
    
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Sun Jul 06 02:13:03 UTC 2025
    - 9K bytes
    - Viewed (0)
  8. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnectionPool.kt

       * simultaneously adopted and removed.
       */
      private val connections = ConcurrentLinkedQueue<RealConnection>()
    
      init {
        // Put a floor on the keep alive duration, otherwise cleanup will spin loop.
        require(keepAliveDuration > 0L) { "keepAliveDuration <= 0: $keepAliveDuration" }
      }
    
      fun idleConnectionCount(): Int =
        connections.count {
          it.withLock { it.calls.isEmpty() }
        }
    
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Wed Oct 08 03:50:05 UTC 2025
    - 11.1K bytes
    - Viewed (0)
  9. android/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()) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Aug 06 17:32:30 UTC 2025
    - 9.8K bytes
    - Viewed (0)
  10. guava/src/com/google/common/hash/BloomFilterStrategies.java

        }
      },
      /**
       * This strategy uses all 128 bits of {@link Hashing#murmur3_128} when hashing. It looks different
       * from the implementation in MURMUR128_MITZ_32 because we're avoiding the multiplication in the
       * loop and doing a (much simpler) += hash2. We're also changing the index to a positive number by
       * AND'ing with Long.MAX_VALUE instead of flipping the bits.
       */
      MURMUR128_MITZ_64() {
        @Override
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Jan 08 14:27:16 UTC 2025
    - 10.7K bytes
    - Viewed (0)
Back to top