Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 1,728 for largest (0.06 sec)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Settings.kt

        /** Window size in bytes. */
        const val INITIAL_WINDOW_SIZE = 4
    
        /** HTTP/2: Size in bytes of the largest frame payload the sender will accept. */
        const val MAX_FRAME_SIZE = 5
    
        /** HTTP/2: Advisory only. Size in bytes of the largest header list the sender will accept. */
        const val MAX_HEADER_LIST_SIZE = 6
    
        /** Total number of settings. */
        const val COUNT = 10
      }
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 3.8K bytes
    - Viewed (0)
  2. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/concurrent/TaskLogger.kt

     * units away from 0 and 0.499 towards 0. The smallest unit this returns is "µs"; the largest unit
     * it returns is "s". For values in [-499..499] this returns "  0 µs".
     *
     * The returned string attempts to be column-aligned to 6 characters. For negative and large values
     * the returned string may be longer.
     */
    fun formatDuration(ns: Long): String {
      val s =
        when {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 2.6K bytes
    - Viewed (0)
  3. docs/erasure/README.md

    divides the drives you provide into erasure-coding sets of *2 to 16* drives.  Therefore, the number of drives you present must be a multiple of one of these numbers.  Each object is written to a single erasure-coding set.
    
    Minio uses the largest possible EC set size which divides into the number of drives given. For example, *18 drives* are configured as *2 sets of 9 drives*, and *24 drives* are configured as *2 sets of 12 drives*.  This is true for scenarios when running MinIO as a standalone...
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/TopKSelector.java

       * range [0, k) and ignore the remaining elements.
       */
      private final @Nullable T[] buffer;
      private int bufferSize;
    
      /**
       * The largest of the lowest k elements we've seen so far relative to this comparator. If
       * bufferSize ≥ k, then we can ignore any elements greater than this value.
       */
      private @Nullable T threshold;
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 31 13:15:26 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  5. docs/distributed/README.md

    - **MinIO creates erasure-coding sets of _2_ to _16_ drives per set.  The number of drives you provide in total must be a multiple of one of those numbers.**
    - **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  6. src/builtin/builtin.go

    //     buffer capacity. If zero, or the size is omitted, the channel is
    //     unbuffered.
    func make(t Type, size ...IntegerType) Type
    
    // The max built-in function returns the largest value of a fixed number of
    // arguments of [cmp.Ordered] types. There must be at least one argument.
    // If T is a floating-point type and any of the arguments are NaNs,
    // max will return NaN.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Dec 30 23:59:23 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  7. cmd/endpoint-ellipses.go

    	// prefers setCounts to be sorted for optimal behavior.
    	if divisibleSize < setCounts[len(setCounts)-1] {
    		return divisibleSize
    	}
    
    	// Figure out largest value of total_drives_in_erasure_set which results
    	// in least number of total_drives/total_drives_erasure_set ratio.
    	prevD := divisibleSize / setCounts[0]
    	for _, cnt := range setCounts {
    		if divisibleSize%cnt == 0 {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 14.6K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/primitives/ImmutableLongArray.java

        public boolean contains(@Nullable Object target) {
          return indexOf(target) >= 0;
        }
    
        @Override
        public int indexOf(@Nullable Object target) {
          return target instanceof Long ? parent.indexOf((Long) target) : -1;
        }
    
        @Override
        public int lastIndexOf(@Nullable Object target) {
          return target instanceof Long ? parent.lastIndexOf((Long) target) : -1;
        }
    
        @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 22K bytes
    - Viewed (0)
  9. guava/src/com/google/common/primitives/ImmutableIntArray.java

        @Override
        public boolean contains(@Nullable Object target) {
          return indexOf(target) >= 0;
        }
    
        @Override
        public int indexOf(@Nullable Object target) {
          return target instanceof Integer ? parent.indexOf((Integer) target) : -1;
        }
    
        @Override
        public int lastIndexOf(@Nullable Object target) {
          return target instanceof Integer ? parent.lastIndexOf((Integer) target) : -1;
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 21.4K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/BigIntegerMath.java

       * @since 20.0
       */
      public static BigInteger ceilingPowerOfTwo(BigInteger x) {
        return BigInteger.ZERO.setBit(log2(x, CEILING));
      }
    
      /**
       * Returns the largest power of two less than or equal to {@code x}. This is equivalent to {@code
       * BigInteger.valueOf(2).pow(log2(x, FLOOR))}.
       *
       * @throws IllegalArgumentException if {@code x <= 0}
       * @since 20.0
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
Back to top