/** The key of the configuration. e.g. 10 */
    String SUGGEST_POPULAR_WORD_SIZE = "suggest.popular.word.size";

    /** The key of the configuration. e.g. 30 */
    String SUGGEST_POPULAR_WORD_WINDOW_SIZE = "suggest.popular.word.window.size";

    /** The key of the configuration. e.g. 10 */
    String SUGGEST_POPULAR_WORD_QUERY_FREQ = "suggest.popular.word.query.freq";

        training loop.
    *   **Performance regression on `ParameterServerStrategy`.** This could be
        significant if you have many PS servers. We are aware of this issue and
        working on fixes, for now we suggest using the legacy optimizers when
        using `ParameterServerStrategy`.
    *   **Timeout or performance loss.** We don't anticipate this to happen, but
        if you see such issues, please use the legacy optimizer, and file

mLimbs, Y) T[n+i], c = bits.Add(c1, c2, c) } // Finally for Step 7 we copy the final T window into x, and subtract m // if necessary (which as explained in maybeSubtractModulus can be the // case both if x >= m, or if x overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken...