Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 209 for ceil (0.15 sec)

  1. src/main/java/jcifs/smb1/util/Base64.java

         */
        public static String encode(byte[] bytes) {
            int length = bytes.length;
            if (length == 0) return "";
            StringBuffer buffer =
                    new StringBuffer((int) Math.ceil((double) length / 3d) * 4);
            int remainder = length % 3;
            length -= remainder;
            int block;
            int i = 0;
            while (i < length) {
    Java
    - Registered: Sun Apr 14 00:10:09 GMT 2024
    - Last Modified: Fri Mar 22 20:39:42 GMT 2019
    - 3.7K bytes
    - Viewed (0)
  2. cmd/warm-backend-minio.go

    	}
    
    	configuredPartSize := minPartSize
    	// Use floats for part size for all calculations to avoid
    	// overflows during float64 to int64 conversions.
    	partSizeFlt := float64(objectSize / maxPartsCount)
    	partSizeFlt = math.Ceil(partSizeFlt/float64(configuredPartSize)) * float64(configuredPartSize)
    
    	// Part size.
    	partSize = int64(partSizeFlt)
    	if partSize == 0 {
    		return minPartSize, nil
    	}
    	return partSize, nil
    }
    
    Go
    - Registered: Sun Apr 14 19:28:10 GMT 2024
    - Last Modified: Mon Apr 08 09:22:27 GMT 2024
    - 3.9K bytes
    - Viewed (0)
  3. cmd/benchmark-utils_test.go

    	b.ReportAllocs()
    	// the actual benchmark for PutObjectPart starts here. Reset the benchmark timer.
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		// insert the object.
    		totalPartsNR := int(math.Ceil(float64(objSize) / float64(partSize)))
    		for j := 0; j < totalPartsNR; j++ {
    			if j < totalPartsNR-1 {
    				textPartData = textData[j*partSize : (j+1)*partSize-1]
    			} else {
    				textPartData = textData[j*partSize:]
    Go
    - Registered: Sun Apr 14 19:28:10 GMT 2024
    - Last Modified: Fri Dec 23 15:46:00 GMT 2022
    - 8.2K bytes
    - Viewed (0)
  4. cmd/utils.go

    // of crashing.
    func ceilFrac(numerator, denominator int64) (ceil int64) {
    	if denominator == 0 {
    		// do nothing on invalid input
    		return
    	}
    	// Make denominator positive
    	if denominator < 0 {
    		numerator = -numerator
    		denominator = -denominator
    	}
    	ceil = numerator / denominator
    	if numerator > 0 && numerator%denominator != 0 {
    		ceil++
    	}
    	return
    }
    
    Go
    - Registered: Sun Apr 14 19:28:10 GMT 2024
    - Last Modified: Thu Apr 11 01:10:30 GMT 2024
    - 32.2K bytes
    - Viewed (0)
  5. src/main/webapp/js/admin/plugins/timepicker/bootstrap-timepicker.min.js

    this.$element.data().timepicker},setDefaultTime:function(a){if(this.$element.val())this.updateFromElementVal();else if("current"===a){var b=new Date,c=b.getHours(),d=b.getMinutes(),e=b.getSeconds(),f="AM";0!==e&&(e=Math.ceil(b.getSeconds()/this.secondStep)*this.secondStep,60===e&&(d+=1,e=0)),0!==d&&(d=Math.ceil(b.getMinutes()/this.minuteStep)*this.minuteStep,60===d&&(c+=1,d=0)),this.showMeridian&&(0===c?c=12:c>=12?(c>12&&(c-=12),f="PM"):f="AM"),this.hour=c,this.minute=d,this.second=e,this.meridian=f,this.update()}else...
    JavaScript
    - Registered: Mon Apr 15 08:04:17 GMT 2024
    - Last Modified: Thu Feb 13 04:21:06 GMT 2020
    - 18.2K bytes
    - Viewed (0)
  6. cmd/bucket-object-lock.go

    	}
    
    	// Pass in relative days from current time, to additionally
    	// to verify "object-lock-remaining-retention-days" policy if any.
    	days := int(math.Ceil(math.Abs(objRetention.RetainUntilDate.Sub(t).Hours()) / 24))
    
    	ret := objectlock.GetObjectRetentionMeta(oi.UserDefined)
    	if ret.Mode.Valid() {
    		// Retention has expired you may change whatever you like.
    Go
    - Registered: Sun Apr 14 19:28:10 GMT 2024
    - Last Modified: Thu Apr 04 12:04:40 GMT 2024
    - 13.3K bytes
    - Viewed (0)
  7. common-protos/k8s.io/api/flowcontrol/v1beta2/generated.proto

      // the assured concurrency value (ACV) --- the number of requests
      // that may be executing at a time --- for each such priority
      // level:
      //
      //             ACV(l) = ceil( SCL * ACS(l) / ( sum[priority levels k] ACS(k) ) )
      //
      // bigger numbers of ACS mean more reserved concurrent requests (at the
      // expense of every other PL).
      // This field has a default value of 30.
      // +optional
    Plain Text
    - Registered: Wed Apr 17 22:53:10 GMT 2024
    - Last Modified: Mon Mar 11 18:43:24 GMT 2024
    - 19.4K bytes
    - Viewed (0)
  8. common-protos/k8s.io/api/flowcontrol/v1alpha1/generated.proto

      // the assured concurrency value (ACV) --- the number of requests
      // that may be executing at a time --- for each such priority
      // level:
      //
      //             ACV(l) = ceil( SCL * ACS(l) / ( sum[priority levels k] ACS(k) ) )
      //
      // bigger numbers of ACS mean more reserved concurrent requests (at the
      // expense of every other PL).
      // This field has a default value of 30.
      // +optional
    Plain Text
    - Registered: Wed Apr 17 22:53:10 GMT 2024
    - Last Modified: Mon Mar 11 18:43:24 GMT 2024
    - 19.4K bytes
    - Viewed (0)
  9. common-protos/k8s.io/api/flowcontrol/v1beta1/generated.proto

      // the assured concurrency value (ACV) --- the number of requests
      // that may be executing at a time --- for each such priority
      // level:
      //
      //             ACV(l) = ceil( SCL * ACS(l) / ( sum[priority levels k] ACS(k) ) )
      //
      // bigger numbers of ACS mean more reserved concurrent requests (at the
      // expense of every other PL).
      // This field has a default value of 30.
      // +optional
    Plain Text
    - Registered: Wed Apr 17 22:53:10 GMT 2024
    - Last Modified: Mon Mar 11 18:43:24 GMT 2024
    - 19.4K bytes
    - Viewed (0)
  10. common-protos/k8s.io/api/flowcontrol/v1beta3/generated.proto

      // borrowing seats from this level.
      // The server's concurrency limit (ServerCL) is divided among the
      // Limited priority levels in proportion to their NCS values:
      //
      // NominalCL(i)  = ceil( ServerCL * NCS(i) / sum_ncs )
      // sum_ncs = sum[limited priority level k] NCS(k)
      //
      // Bigger numbers mean a larger nominal concurrency limit,
      // at the expense of every other Limited priority level.
    Plain Text
    - Registered: Wed Apr 17 22:53:10 GMT 2024
    - Last Modified: Mon Mar 11 18:43:24 GMT 2024
    - 19.5K bytes
    - Viewed (0)
Back to top