Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 94 for calculations (0.31 sec)

  1. cmd/site-replication-metrics.go

    	// Total Replica received
    	ReplicaCount int64                `json:"replicaCount"`
    	M            map[string]*SRStatus `json:"srStatusMap"`
    
    	movingAvgTicker *time.Ticker // Ticker for calculating moving averages
    	lock            sync.RWMutex // mutex for srStats
    }
    
    // SRStatus has replication stats at deployment level
    type SRStatus struct {
    	ReplicatedSize int64 `json:"completedReplicationSize"`
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Feb 06 06:00:45 UTC 2024
    - 8.2K bytes
    - Viewed (0)
  2. src/main/java/jcifs/internal/smb1/trans/SmbComTransaction.java

                    this.pad1 = this.pad(this.parameterOffset);
                    this.parameterOffset += this.pad1;
                }
    
                // caclulate parameterDisplacement before calculating new parameterCount
                this.parameterDisplacement += this.parameterCount;
    
                int available = this.maxBufferSize - this.parameterOffset - this.pad1;
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun May 17 13:43:42 UTC 2020
    - 13.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/PairedStatsAccumulator.java

          return;
        }
    
        xStats.addAll(values.xStats());
        if (yStats.count() == 0) {
          sumOfProductsOfDeltas = values.sumOfProductsOfDeltas();
        } else {
          // This is a generalized version of the calculation in add(double, double) above. Note that
          // non-finite inputs will have sumOfProductsOfDeltas = NaN, so non-finite values will result
          // in NaN naturally.
          sumOfProductsOfDeltas +=
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 10.3K bytes
    - Viewed (0)
  4. cmd/signature-v4-utils_test.go

    		{"X-Amz-Content-Sha256", unsignedPayload, "", "", true},
    
    		// Test case - 7.
    		// "X-Amz-Content-Sha256" not set and  PreSigned Signature v4 not enabled, sha256 checksum calculation is not skipped.
    		{"", "", "X-Amz-Credential", "", true},
    
    		// Test case - 8.
    		// "X-Amz-Content-Sha256" has a proper value cannot skip.
    		{"X-Amz-Content-Sha256", "somevalue", "", "", false},
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 05 21:26:41 UTC 2024
    - 14.3K bytes
    - Viewed (0)
  5. internal/hash/reader.go

    // simply converts positional arguments to NewReader() into a
    // more flexible way to provide optional inputs. This is currently
    // used by the FanOut API call mostly to disable expensive md5sum
    // calculation repeatedly under hash.Reader.
    type Options struct {
    	MD5Hex     string
    	SHA256Hex  string
    	Size       int64
    	ActualSize int64
    	DisableMD5 bool
    	ForceMD5   []byte
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 19 12:59:07 UTC 2024
    - 10.9K bytes
    - Viewed (0)
  6. internal/s3select/message.go

    	"net/http"
    	"strconv"
    	"sync/atomic"
    	"time"
    )
    
    // A message is in the format specified in
    // https://docs.aws.amazon.com/AmazonS3/latest/API/images/s3select-frame-diagram-frame-overview.png
    // hence the calculation is made accordingly.
    func totalByteLength(headerLength, payloadLength int) int {
    	return 4 + 4 + 4 + headerLength + payloadLength + 4
    }
    
    func genMessage(header, payload []byte) []byte {
    	headerLength := len(header)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 30 15:26:43 UTC 2022
    - 15.2K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/math/QuantilesTest.java

      }
    
      public void testScale_indexes_largeVarargs_compute_doubleCollection() {
        int scale = Integer.MAX_VALUE;
        int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly
        // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and
        // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part
        // (1-5/Integer.MAX_VALUE).
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 29.7K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/math/StatsAccumulator.java

          min = otherMin;
          max = otherMax;
        } else {
          count += otherCount;
          if (isFinite(mean) && isFinite(otherMean)) {
            // This is a generalized version of the calculation in add(double) above.
            double delta = otherMean - mean;
            mean += delta * otherCount / count;
            sumOfSquaresOfDeltas += otherSumOfSquaresOfDeltas + delta * (otherMean - mean) * otherCount;
          } else {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 23 16:45:30 UTC 2024
    - 15.8K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb1/smb1/ServerMessageBlock.java

        static final byte SMB_COM_NT_CREATE_ANDX     = (byte)0xA2;
    
        /*
         * Some fields specify the offset from the beginning of the header. This
         * field should be used for calculating that. This would likely be zero
         * but an implemantation that encorporates the transport header(for
         * efficiency) might use a different initial bufferIndex. For example,
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 21K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/Collections2.java

          calculateNextPermutation();
          return next;
        }
    
        void calculateNextPermutation() {
          j = list.size() - 1;
          int s = 0;
    
          // Handle the special case of an empty list. Skip the calculation of the
          // next permutation.
          if (j == -1) {
            return;
          }
    
          while (true) {
            int q = c[j] + o[j];
            if (q < 0) {
              switchDirection();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 22.8K bytes
    - Viewed (0)
Back to top