Search Options

Results per page
Sort
Preferred Languages
Advance

Results 161 - 170 of 844 for mount (0.09 sec)

  1. helm-releases/minio-5.3.0.tgz

    OpenStack) ## ## Storage class of PV to bind. By default it looks for standard storage class. ## If the PV uses a different storage class, specify that here. storageClass: "" volumeName: "" accessMode: ReadWriteOnce size: 500Gi ## If subPath is set mount a sub folder of a volume instead of the root of the volume. ## This is especially handy for volume plugins that don't natively support sub mounting (like glusterfs). ## subPath: "" ## Expose the MinIO service to be accessed from outside the cluster...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 11 12:21:05 UTC 2024
    - 21.7K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.16.md

    - Fix: azure file mount timeout issue ([#88610](https://github.com/kubernetes/kubernetes/pull/88610), [@andyzhangx](https://github.com/andyzhangx)) [SIG Cloud Provider and Storage]
    - Fix: corrupted mount point in csi driver ([#88569](https://github.com/kubernetes/kubernetes/pull/88569), [@andyzhangx](https://github.com/andyzhangx)) [SIG Storage]
    Registered: Fri Nov 01 09:05:11 UTC 2024
    - Last Modified: Thu Feb 11 10:00:57 UTC 2021
    - 345.2K bytes
    - Viewed (0)
  3. src/cmd/asm/internal/asm/parse.go

    		tok := p.next()
    		ext = tok.String()
    	}
    	if p.peek() == lex.LSH {
    		// parses left shift amount applied after extension: <<Amount
    		p.get(lex.LSH)
    		tok := p.get(scanner.Int)
    		amount, err := strconv.ParseInt(tok.String(), 10, 16)
    		if err != nil {
    			p.errorf("parsing left shift amount: %s", err)
    		}
    		num = int16(amount)
    	} else if p.peek() == '[' {
    		// parses an element: [Index]
    		p.get('[')
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Sep 04 18:16:59 UTC 2024
    - 36.9K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java

       * becomes {@code count}.
       *
       * @return the count of {@code element} in the multiset before this call
       * @throws IllegalArgumentException if {@code count} is negative
       */
      @CanIgnoreReturnValue
      @Override
      public int setCount(E element, int count) {
        checkNotNull(element);
        checkNonnegative(count, "count");
        while (true) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 21.1K bytes
    - Viewed (0)
  5. okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt

          return state.policy.backoffDelayMillis.jitterBy(state.policy.backoffJitterMillis) * 1_000_000
        }
      }
    
      private fun Long.jitterBy(amount: Int): Long {
        return this + ThreadLocalRandom.current().nextInt(amount * -1, amount)
      }
    
      class AddressState(
        val address: Address,
        val queue: TaskQueue,
        var policy: ConnectionPool.AddressPolicy,
      ) {
        /**
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Apr 20 17:03:43 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  6. docs/distributed/DESIGN.md

    Refer to the sizing guide with details on the default parity count chosen for different erasure stripe sizes [here](https://github.com/minio/minio/blob/master/docs/distributed/SIZING.md)
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 15 23:04:20 UTC 2023
    - 8K bytes
    - Viewed (0)
  7. src/main/webapp/js/admin/moment-with-locales.min.js

    ,50:"-\u0447\u04af",60:"-\u0447\u044b",70:"-\u0447\u0438",80:"-\u0447\u0438",90:"-\u0447\u0443",100:"-\u0447\u04af"};function En(e,a,t,s){var n={m:["eng Minutt","enger Minutt"],h:["eng Stonn","enger Stonn"],d:["een Dag","engem Dag"],M:["ee Mount","engem Mount"],y:["ee Joer","engem Joer"]};return a?n[t][0]:n[t][1]}function Fn(e){if(e=parseInt(e,10),isNaN(e))return!1;if(e<0)return!0;if(e<10)return 4<=e&&e<=7;if(e<100){var a=e%10;return 0==a?Fn(e/10):Fn(a)}if(e<1e4){for(;10<=e;)e/=10;return Fn(e)}return...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 360.5K bytes
    - Viewed (1)
  8. common-protos/k8s.io/api/autoscaling/v2beta2/generated.proto

      // metrics contains the specifications for which to use to calculate the
      // desired replica count (the maximum replica count across all metrics will
      // be used).  The desired replica count is calculated multiplying the
      // ratio between the target value and the current value by the current
      // number of pods.  Ergo, metrics used must decrease as the pod count is
      // increased, and vice-versa.  See the individual metric source types for
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 21K bytes
    - Viewed (0)
  9. cmd/batch-expire.go

    	}
    
    	allErrs := make([]error, 0, len(objsToDel))
    
    	for {
    		count := len(objsToDel)
    		if count == 0 {
    			break
    		}
    		if count > maxDeleteList {
    			count = maxDeleteList
    		}
    		_, errs := api.DeleteObjects(ctx, r.Bucket, objsToDel[:count], opts)
    		allErrs = append(allErrs, errs...)
    		// Next batch of deletion
    		objsToDel = objsToDel[count:]
    	}
    
    	return allErrs
    }
    
    const (
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Sep 18 17:59:03 UTC 2024
    - 21.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/CompactHashing.java

      static final byte UNSET = 0;
    
      /** Number of bits used to store the numbers of hash table bits (max 30). */
      private static final int HASH_TABLE_BITS_MAX_BITS = 5;
    
      /** Use high bits of metadata for modification count. */
      static final int MODIFICATION_COUNT_INCREMENT = (1 << HASH_TABLE_BITS_MAX_BITS);
    
      /** Bitmask that selects the low bits of metadata to get hashTableBits. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 15:34:52 UTC 2024
    - 7.1K bytes
    - Viewed (0)
Back to top