* provides more control over the underlying data structure.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */
  public static <K extends @Nullable Object, V extends @Nullable Object>

labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message

labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message

    /** The key of the message: Request Average Time/Hour */
    public static final String LABELS_searchlog_log_type_search_reqtimeavg_hour = "{labels.searchlog_log_type_search_reqtimeavg_hour}";

    /** The key of the message: Request Average Time/Day */

// indeed that's what both the original RSA paper and the pre-FIPS // crypto/rsa implementation did. // // However, FIPS 186-5, A.1.1(3) requires computing it as e⁻¹ mod λ(N) // where λ(N) = lcm(p-1, q-1). // // This makes d smaller by 1.5 bits on average, which is irrelevant both // because we exclusively use the CRT for private operations and because // we use constant time windowed exponentiation. On the other hand, it // requires computing a GCD of two values that are not coprime, and then // a...