Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 81 for Capacity (0.21 sec)

  1. internal/config/storageclass/help.go

    			Optional:    true,
    			Type:        "string",
    		},
    		config.HelpKV{
    			Key:         Optimize,
    			Description: `optimize parity calculation for standard storage class, set 'capacity' for capacity optimized (no additional parity)` + defaultHelpPostfix(Optimize),
    			Optional:    true,
    			Type:        "string",
    		},
    		config.HelpKV{
    			Key:         config.Comment,
    			Description: config.DefaultComment,
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Tue Mar 26 22:06:19 GMT 2024
    - 1.8K bytes
    - Viewed (0)
  2. internal/grid/handlers.go

    		// Should not be set unless there are different handlers for the same HandlerID.
    		Subroute string
    
    		// OutCapacity is the output capacity. If <= 0 capacity will be 1.
    		OutCapacity int
    
    		// InCapacity is the output capacity.
    		// If == 0 no input is expected
    		InCapacity int
    	}
    )
    
    type subHandlerID [32]byte
    
    func makeSubHandlerID(id HandlerID, subRoute string) subHandlerID {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Tue Apr 23 17:15:52 GMT 2024
    - 27.1K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/core/collection/LruHashMap.java

     */
    public class LruHashMap<K, V> extends LinkedHashMap<K, V> {
    
        private static final long serialVersionUID = 1L;
    
        /**
         * デフォルトの初期容量です。
         */
        protected static final int DEFAULT_INITIAL_CAPACITY = 16;
    
        /**
         * デフォルトのロードファクタです。
         */
        protected static final float DEFAULT_LOAD_FACTOR = 0.75f;
    
        /**
         * 上限サイズです。
         */
        protected final int limitSize;
    
        /**
    Java
    - Registered: Fri May 03 20:58:11 GMT 2024
    - Last Modified: Thu Mar 07 01:59:08 GMT 2024
    - 2.4K bytes
    - Viewed (0)
  4. doc/next/6-stdlib/99-minor/reflect/61308.md

    The [SliceAt(typ Type, p unsafe.Pointer, len int)] function
    returns a Value representing a slice whose underlying array starts
    Plain Text
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Fri Apr 12 20:57:18 GMT 2024
    - 170 bytes
    - Viewed (0)
  5. internal/grid/grid.go

    // There is no minimum size.
    var GetByteBuffer = func() []byte {
    	b := *internalByteBuffer.Get().(*[]byte)
    	return b[:0]
    }
    
    // GetByteBufferCap returns a length 0 byte buffer with at least the given capacity.
    func GetByteBufferCap(wantSz int) []byte {
    	if wantSz < defaultBufferSize {
    		b := GetByteBuffer()[:0]
    		if cap(b) >= wantSz {
    			return b
    		}
    		PutByteBuffer(b)
    	}
    	if wantSz <= maxBufferSize {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Tue Apr 02 15:56:18 GMT 2024
    - 4.8K bytes
    - Viewed (0)
  6. docs/metrics/prometheus/list.md

    | `minio_cluster_capacity_usable_free_bytes`   | Total free usable capacity online in the cluster.              |
    | `minio_cluster_capacity_usable_total_bytes`  | Total usable capacity online in the cluster.                   |
    | `minio_cluster_objects_size_distribution`    | Distribution of object sizes across a cluster                  |
    Plain Text
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Apr 25 22:01:31 GMT 2024
    - 43.4K bytes
    - Viewed (2)
  7. docs/metrics/v3.md

    | `minio_cluster_health_capacity_raw_total_bytes`    | `gauge` | Total cluster raw storage capacity in bytes    |        |
    | `minio_cluster_health_capacity_raw_free_bytes`     | `gauge` | Total cluster raw storage free in bytes        |        |
    | `minio_cluster_health_capacity_usable_total_bytes` | `gauge` | Total cluster usable storage capacity in bytes |        |
    Plain Text
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu May 02 17:37:57 GMT 2024
    - 28.5K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/HashMultiset.java

    @ElementTypesAreNonnullByDefault
    public final class HashMultiset<E extends @Nullable Object> extends AbstractMapBasedMultiset<E> {
    
      /** Creates a new, empty {@code HashMultiset} using the default initial capacity. */
      public static <E extends @Nullable Object> HashMultiset<E> create() {
        return new HashMultiset<>();
      }
    
      /**
       * Creates a new, empty {@code HashMultiset} with the specified expected number of distinct
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 3.4K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/core/collection/CollectionsUtil.java

         * @param <E>
         *            {@link ArrayBlockingQueue}の要素型
         * @param capacity
         *            キューの容量
         * @return {@link ArrayBlockingQueue}の新しいインスタンス
         * @see ArrayBlockingQueue#ArrayBlockingQueue(int)
         */
        public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(final int capacity) {
            return new ArrayBlockingQueue<>(capacity);
        }
    
        /**
         * {@link ArrayBlockingQueue}の新しいインスタンスを作成して返します。
    Java
    - Registered: Fri May 03 20:58:11 GMT 2024
    - Last Modified: Thu Mar 07 01:59:08 GMT 2024
    - 53.9K bytes
    - Viewed (0)
  10. src/main/java/org/codelibs/core/collection/ArrayMap.java

         */
        public ArrayMap() {
            this(INITIAL_CAPACITY);
        }
    
        /**
         * 指定された初期容量を持つインスタンスを構築します。
         *
         * @param initialCapacity
         *            初期容量
         */
        @SuppressWarnings("unchecked")
        public ArrayMap(int initialCapacity) {
            if (initialCapacity <= 0) {
                initialCapacity = INITIAL_CAPACITY;
            }
            mapTable = new Entry[initialCapacity];
    Java
    - Registered: Fri May 03 20:58:11 GMT 2024
    - Last Modified: Thu Mar 07 01:59:08 GMT 2024
    - 20.6K bytes
    - Viewed (1)
Back to top