}

    /**
     * Sets the maximum number of session IDs to include in session ID lists.
     * This controls the size limit for aggregation results when retrieving session lists.
     *
     * @param maxSessionIdsInList the maximum number of session IDs to include in lists
     */
    public void setMaxSessionIdsInList(final int maxSessionIdsInList) {

}

// SRStatus has replication stats at deployment level
type SRStatus struct {
	ReplicatedSize int64 `json:"completedReplicationSize"`
	// Total number of failed operations including metadata updates in the last minute
	Failed RTimedMetrics `json:"failedReplication"`
	// Total number of completed operations
	ReplicatedCount int64 `json:"replicationCount"`
	// Replication latency information

     * Continues an MD4 message digest using the input byte.
     */
    @Override
    public void engineUpdate(final byte b) {
        // compute number of bytes still unhashed; ie. present in buffer
        final int i = (int) (count % BLOCK_LENGTH);
        count++; // update number of bytes
        buffer[i] = b;
        if (i == BLOCK_LENGTH - 1) {
            transform(buffer, 0);
        }
    }

    /**

     * Get the value for the key 'query.highlight.number.of.fragments'. <br>
     * The value is, e.g. 2 <br>
     * comment: Number of fragments for query highlighting.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getQueryHighlightNumberOfFragments();

    /**
     * Get the value for the key 'query.highlight.number.of.fragments' as {@link Integer}. <br>

     */
    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")
			}
		}
	})