return DEFAULT_CURRENT_PAGE_NUMBER;
    }

    /**
     * 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
     */

  int charSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(CHAR_SPLITTER.split(input));
    }

    return total;
  }

  @Benchmark
  int stringSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(STRING_SPLITTER.split(input));
    }

    return total;
  }

        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) {

     * 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();
    }

    /**

    }

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

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

            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() {

    }

    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) {

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

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