Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 306 for Total (0.03 sec)

  1. cmd/metrics.go

    	totalDisks := offlineDisks.Merge(onlineDisks)
    
    	// Report total capacity
    	ch <- prometheus.MustNewConstMetric(
    		prometheus.NewDesc(
    			prometheus.BuildFQName(minioNamespace, "capacity_raw", "total"),
    			"Total capacity online in the cluster",
    			nil, nil),
    		prometheus.GaugeValue,
    		float64(GetTotalCapacity(server.Disks)),
    	)
    
    	// Report total capacity free
    	ch <- prometheus.MustNewConstMetric(
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 15 12:04:40 UTC 2024
    - 16.6K bytes
    - Viewed (0)
  2. docs/metrics/v3.md

    | `minio_api_requests_rejected_auth_total`       | Total number of requests rejected for auth failure. <br><br>Type: counter      | `type`, `pool_index`, `server`               |
    | `minio_api_requests_rejected_header_total`     | Total number of requests rejected for invalid header. <br><br>Type: counter    | `type`, `pool_index`, `server`               |
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Aug 02 22:30:11 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  3. cmd/local-locker_gen.go

    		zb0001--
    		field, err = dc.ReadMapKeyPtr()
    		if err != nil {
    			err = msgp.WrapError(err)
    			return
    		}
    		switch msgp.UnsafeString(field) {
    		case "Total":
    			z.Total, err = dc.ReadInt()
    			if err != nil {
    				err = msgp.WrapError(err, "Total")
    				return
    			}
    		case "Writes":
    			z.Writes, err = dc.ReadInt()
    			if err != nil {
    				err = msgp.WrapError(err, "Writes")
    				return
    			}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jul 24 10:24:01 UTC 2024
    - 13.9K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/suggest/request/popularwords/PopularWordsResponse.java

        protected final long total;
    
        protected final List<SuggestItem> items;
    
        public PopularWordsResponse(final String index, final long tookMs, final List<String> words, final long total,
                final List<SuggestItem> items) {
            this.index = index;
            this.tookMs = tookMs;
            this.words = words;
            num = words.size();
            this.total = total;
            this.items = items;
        }
    
    Registered: Fri Nov 08 09:08:12 UTC 2024
    - Last Modified: Sat Oct 12 00:10:39 UTC 2024
    - 1.7K bytes
    - Viewed (0)
  5. internal/disk/stat_bsd.go

    		Files:  s.Files,
    		Ffree:  s.Ffree,
    		FSType: getFSType(s.Fstypename[:]),
    	}
    	if info.Free > info.Total {
    		return info, fmt.Errorf("detected free space (%d) > total drive space (%d), fs corruption at (%s). please run 'fsck'", info.Free, info.Total, path)
    	}
    	info.Used = info.Total - info.Free
    	return info, nil
    }
    
    // GetDriveStats returns IO stats of the drive by its major:minor
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 26 19:34:50 UTC 2024
    - 1.7K bytes
    - Viewed (0)
  6. guava-tests/benchmark/com/google/common/base/StopwatchBenchmark.java

    public class StopwatchBenchmark {
      @Benchmark
      long stopwatch(int reps) {
        long total = 0;
        for (int i = 0; i < reps; i++) {
          Stopwatch s = Stopwatch.createStarted();
          // here is where you would do something
          total += s.elapsed(NANOSECONDS);
        }
        return total;
      }
    
      @Benchmark
      long manual(int reps) {
        long total = 0;
        for (int i = 0; i < reps; i++) {
          long start = System.nanoTime();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 1.5K bytes
    - Viewed (0)
  7. compat/maven-resolver-provider/src/test/java/org/apache/maven/repository/internal/util/ConsoleTransferListener.java

            print("transferProgressed", buffer.toString());
        }
    
        private String getStatus(long complete, long total) {
            if (total >= 1024) {
                return toKB(complete) + "/" + toKB(total) + " KB ";
            } else if (total >= 0) {
                return complete + "/" + total + " B ";
            } else if (complete >= 1024) {
                return toKB(complete) + " KB ";
            } else {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  8. cmd/metrics-v3-cluster-usage.go

    	usageTotalBytesMD = NewGaugeMD(usageTotalBytes,
    		"Total cluster usage in bytes")
    	usageObjectsCountMD = NewGaugeMD(usageObjectsCount,
    		"Total cluster objects count")
    	usageVersionsCountMD = NewGaugeMD(usageVersionsCount,
    		"Total cluster object versions (including delete markers) count")
    	usageDeleteMarkersCountMD = NewGaugeMD(usageDeleteMarkersCount,
    		"Total cluster delete markers count")
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun Jul 14 18:11:42 UTC 2024
    - 6.5K bytes
    - Viewed (0)
  9. cmd/metrics-v3-system-drive.go

    var (
    	driveUsedBytesMD = NewGaugeMD(driveUsedBytes,
    		"Total storage used on a drive in bytes", allDriveLabels...)
    	driveFreeBytesMD = NewGaugeMD(driveFreeBytes,
    		"Total storage free on a drive in bytes", allDriveLabels...)
    	driveTotalBytesMD = NewGaugeMD(driveTotalBytes,
    		"Total storage available on a drive in bytes", allDriveLabels...)
    	driveUsedInodesMD = NewGaugeMD(driveUsedInodes,
    		"Total used inodes on a drive", allDriveLabels...)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun May 12 17:23:50 UTC 2024
    - 7.9K bytes
    - Viewed (0)
  10. docs/distributed/DESIGN.md

    example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
    
    - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 15 23:04:20 UTC 2023
    - 8K bytes
    - Viewed (0)
Back to top