*/
    public void setLength(final int length) {
        this.deferred.length = length;
    }

    /**
     * Advances the buffer index by the specified number of bytes.
     *
     * @param n the number of bytes to advance
     */
    public void advance(final int n) {
        this.index += n;
        if (this.index - this.start > this.deferred.length) {

    BigInteger result;
    do {
      result = randomNonNegativeBigInteger(numBits);
    } while (result.signum() == 0);
    return result;
  }

  /**
   * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
   * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that

    }

    /**
     * Gets the total number of words in the suggest index.
     *
     * @return The total number of words.
     */
    public long getAllWordsNum() {
        return suggester.getAllWordsNum();
    }

    /**
     * Gets the number of words from documents in the suggest index.
     *
     * @return The number of document words.
     */
    public long getDocumentWordsNum() {

	var users2 []User
	DB.Preload("Account", clause.Eq{Column: "number", Value: users[0].Account.Number}).Find(&users2, "id IN ?", userIDs)
	sort.Slice(users2, func(i, j int) bool {
		return users2[i].ID < users2[j].ID
	})

	for idx, user := range users2[1:2] {
		if user.Account.Number != "" {
			t.Errorf("No account should found for user %v but got %v", idx+2, user.Account.Number)
		}
	}

	CheckUser(t, users2[0], users[0])

                                    <div class="form-inline col-sm-9">
                                        <la:errors property="depth"/>
                                        <input type="number" name="depth" id="depth"
                                               value="${f:h(depth)}" class="form-control"
                                               min="0" max="10000">
                                    </div>

		if user.Account.Number != "" {
			if !user.Account.UserID.Valid {
				t.Errorf("Account's foreign key should be saved")
			} else {
				var account Account
				db(unscoped).First(&account, "user_id = ?", user.ID)
				AssertObjEqual(t, account, user.Account, "ID", "CreatedAt", "UpdatedAt", "DeletedAt", "UserID",
					"Number")
			}
		}
	})

package cmd

import "errors"

// errErasureReadQuorum - did not meet read quorum.
var errErasureReadQuorum = errors.New("Read failed. Insufficient number of drives online")

// errErasureWriteQuorum - did not meet write quorum.
var errErasureWriteQuorum = errors.New("Write failed. Insufficient number of drives online")

// errNoHealRequired - returned when healing is attempted on a previously healed disks.

	req, err := http.NewRequest(http.MethodGet, "http://localhost:9000/bucket/name?uploadId=upload&partNumber=1", http.NoBody)
	if err != nil {
		b.Fatal(err)
	}

	// benchmark utility which helps obtain number of allocations and bytes allocated per ops.
	b.ReportAllocs()
	// the actual benchmark for PutObject starts here. Reset the benchmark timer.
	b.ResetTimer()

	if err := req.ParseForm(); err != nil {
		b.Fatal(err)
	}

     *
     * @param buffer the buffer to read into
     * @param remoteAddress remote memory address
     * @param remoteKey remote access key
     * @param length number of bytes to read
     * @return number of bytes read
     * @throws IOException if operation fails
     */
    public int rdmaRead(ByteBuffer buffer, long remoteAddress, int remoteKey, int length) throws IOException {

- **MinIO creates erasure-coding sets of _2_ to _16_ drives per set.  The number of drives you provide in total must be a multiple of one of those numbers.**
- **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.