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...

		}
		switch msgp.UnsafeString(field) {
		case "Totals":
			var zb0002 uint32
			zb0002, err = dc.ReadArrayHeader()
			if err != nil {
				err = msgp.WrapError(err, "Totals")
				return
			}
			if zb0002 != uint32(60) {
				err = msgp.ArrayError{Wanted: uint32(60), Got: zb0002}
				return
			}
			for za0001 := range z.Totals {
				err = z.Totals[za0001].DecodeMsg(dc)
				if err != nil {

    }

    private static final long serialVersionUID = 1L;

    /**
     * Total number of hits.
     */
    private long totalHits;

    /**
     * Time taken for the search in milliseconds.
     */
    private long tookInMillis;

    /**
     * Sets the total number of hits.
     * @param totalHits The total number of hits.
     */
    public void setTotalHits(final long totalHits) {

        return 1;
    }

    /**
     * Gets the total number of records.
     *
     * @return The total record count.
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records.
     *
     * @param allRecordCount The total record count.
     */
    public void setAllRecordCount(final int allRecordCount) {

    }

    /**
     * Gets the total number of records across all pages.
     *
     * @return the total record count
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records across all pages.
     *
     * @param allRecordCount the total record count
     */

     * Get total bytes transferred via RDMA
     *
     * @return total bytes
     */
    public long getBytesTransferred() {
        return bytesTransferred.get();
    }

    /**
     * Get total number of operation errors
     *
     * @return error count
     */
    public long getOperationErrors() {
        return operationErrors.get();
    }

    /**

    protected int currentPageNumber;

    /** The total number of records in the search result set. */
    protected long allRecordCount;

    /** The relation type for the total record count (e.g., "eq", "gte"). */
    protected String allRecordCountRelation;

    /** The total number of pages based on the page size and total record count. */
    protected int allPageCount;

)

var (
	scannerBucketScansFinishedMD = NewCounterMD(scannerBucketScansFinished,
		"Total number of bucket scans finished since server start")
	scannerBucketScansStartedMD = NewCounterMD(scannerBucketScansStarted,
		"Total number of bucket scans started since server start")
	scannerDirectoriesScannedMD = NewCounterMD(scannerDirectoriesScanned,
		"Total number of directories scanned since server start")

            fsObj.path = f.getAbsolutePath();
            fsObj.free = f.getFreeSpace();
            fsObj.total = f.getTotalSpace();
            fsObj.usable = f.getUsableSpace();
            fsObj.used = fsObj.total - fsObj.usable;
            fsObj.percent = (short) (100 * fsObj.used / fsObj.total);
            return fsObj;
        }).toArray(n -> new FsObj[n]);
    }

    private JvmObj getJvmObj() {

│ ID  │ Pools                           │ Capacity                         │ Status │
│ 1st │ http://minio{1...2}/data{1...4} │ 439 GiB (used) / 561 GiB (total) │ Active │
│ 2nd │ http://minio{3...4}/data{1...4} │ 329 GiB (used) / 421 GiB (total) │ Active │
└─────┴─────────────────────────────────┴──────────────────────────────────┴────────┘
```

### Decommissioning status

```