Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 41 - 50 of 537 for negative (0.06 seconds)

  1. cmd/erasure-utils.go

    // outSize length. Provides a way to skip bytes until the offset.
    func writeDataBlocks(ctx context.Context, dst io.Writer, enBlocks [][]byte, dataBlocks int, offset int64, length int64) (int64, error) {
    	// Offset and out size cannot be negative.
    	if offset < 0 || length < 0 {
    		return 0, errUnexpected
    	}
    
    	// Do we have enough blocks?
    	if len(enBlocks) < dataBlocks {
    		return 0, reedsolomon.ErrTooFewShards
    	}
    
    	// Do we have enough data?
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Jan 31 02:11:45 GMT 2024
    - 3.1K bytes
    - Click Count (0)
  2. internal/hash/crc.go

    // and len2 specifies the byte length that the crc2 hash covers.
    func crc32Combine(poly uint32, crc1, crc2 uint32, len2 int64) uint32 {
    	// degenerate case (also disallow negative lengths)
    	if len2 <= 0 {
    		return crc1
    	}
    
    	even := make([]uint64, 32) // even-power-of-two zeros operator
    	odd := make([]uint64, 32)  // odd-power-of-two zeros operator
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Jan 20 14:49:07 GMT 2025
    - 5.8K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/ObjectCountHashMap.java

       * @return a new, empty {@code ObjectCountHashMap} with enough capacity to hold {@code
       *     expectedSize} elements without resizing
       * @throws IllegalArgumentException if {@code expectedSize} is negative
       */
      static <K extends @Nullable Object> ObjectCountHashMap<K> createWithExpectedSize(
          int expectedSize) {
        return new ObjectCountHashMap<K>(expectedSize);
      }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 14.5K bytes
    - Click Count (0)
  4. internal/config/errors.go

    		"Invalid value for batch key rotation workers wait",
    		"Please input a non-negative duration",
    		"keyrotation_workers_wait should be > 0ms",
    	)
    	ErrInvalidBatchReplicationWorkersWait = newErrFn(
    		"Invalid value for batch replication workers wait",
    		"Please input a non-negative duration",
    		"replication_workers_wait should be > 0ms",
    	)
    	ErrInvalidBatchExpirationWorkersWait = newErrFn(
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 9.4K bytes
    - Click Count (0)
  5. guava/src/com/google/common/math/DoubleUtils.java

         * Double.POSITIVE_INFINITY.
         */
        bits |= x.signum() & SIGN_MASK;
        return longBitsToDouble(bits);
      }
    
      /** Returns its argument if it is non-negative, zero if it is negative. */
      static double ensureNonNegative(double value) {
        checkArgument(!isNaN(value));
        return max(value, 0.0);
      }
    
      @VisibleForTesting static final long ONE_BITS = 0x3ff0000000000000L;
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sat Dec 21 03:10:51 GMT 2024
    - 5.1K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/primitives/Chars.java

       * equivalent {@link Character#compare} method instead.
       *
       * @param a the first {@code char} to compare
       * @param b the second {@code char} to compare
       * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is
       *     greater than {@code b}; or zero if they are equal
       */
      @InlineMe(replacement = "Character.compare(a, b)")
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 24.2K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/primitives/Shorts.java

       * equivalent {@link Short#compare} method instead.
       *
       * @param a the first {@code short} to compare
       * @param b the second {@code short} to compare
       * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is
       *     greater than {@code b}; or zero if they are equal
       */
      @InlineMe(replacement = "Short.compare(a, b)")
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Oct 22 18:14:49 GMT 2025
    - 25.7K bytes
    - Click Count (0)
  8. guava/src/com/google/common/primitives/Shorts.java

       * equivalent {@link Short#compare} method instead.
       *
       * @param a the first {@code short} to compare
       * @param b the second {@code short} to compare
       * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is
       *     greater than {@code b}; or zero if they are equal
       */
      @InlineMe(replacement = "Short.compare(a, b)")
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Oct 22 18:14:49 GMT 2025
    - 25.7K bytes
    - Click Count (0)
  9. internal/config/heal/heal.go

    		w, err := strconv.Atoi(ws)
    		if err != nil {
    			return cfg, fmt.Errorf("'heal:drive_workers' value invalid: %w", err)
    		}
    		if w < 1 {
    			return cfg, fmt.Errorf("'heal:drive_workers' value invalid: zero or negative integer unsupported")
    		}
    		cfg.DriveWorkers = w
    	} else {
    		cfg.DriveWorkers = -1
    	}
    
    	return cfg, nil
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Nov 04 19:06:02 GMT 2024
    - 4.9K bytes
    - Click Count (0)
  10. guava/src/com/google/common/math/LongMath.java

          default:
            throw new AssertionError();
        }
        return increment ? div + signum : div;
      }
    
      /**
       * Returns {@code x mod m}, a non-negative value less than {@code m}. This differs from {@code x %
       * m}, which might be negative.
       *
       * <p>For example:
       *
       * {@snippet :
       * mod(7, 4) == 3
       * mod(-7, 4) == 1
       * mod(-1, 4) == 3
       * mod(-8, 4) == 0
       * mod(8, 4) == 0
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Nov 03 21:01:09 GMT 2025
    - 46.8K bytes
    - Click Count (0)
Back to Top