now = datetime.now(tz=timezone.utc)

        # Handle primary rate limits
        primary_limit_wait_time = 0.0
        if self.remaining_points <= self.last_query_cost:
            primary_limit_wait_time = (self.reset_at - now).total_seconds() + 2
            logging.warning(
                f"Approaching GitHub API rate limit, remaining points: {self.remaining_points}, "

     */
    public static AccessTokenHelper getAccessTokenHelper() {
        return getComponent(ACCESS_TOKEN_HELPER);
    }

    /**
     * Gets the rate limit helper component.
     * @return The rate limit helper.
     */
    public static RateLimitHelper getRateLimitHelper() {
        return getComponent(RATE_LIMIT_HELPER);
    }

    /**

#                                                                           Rate Limiting
#                                                                           ==============
# Whether rate limiting is enabled.
rate.limit.enabled=false
# Maximum number of requests allowed per window.
rate.limit.requests.per.window=100
# Window size in milliseconds.
rate.limit.window.ms=60000
# Duration in milliseconds to block IP when limit exceeded.

   *
   * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
   * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
   * operates per-segment rather than globally for increased implementation simplicity. We expect
   * the cache hit rate to be similar to that of a global LRU algorithm.
   */

  // Constants

  /**

   *
   * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
   * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
   * operates per-segment rather than globally for increased implementation simplicity. We expect
   * the cache hit rate to be similar to that of a global LRU algorithm.
   */

  // Constants

  /**

    /** The key of the configuration. e.g. 60 */
    String RATE_LIMIT_RETRY_AFTER_SECONDS = "rate.limit.retry.after.seconds";

    /** The key of the configuration. e.g. 127.0.0.1,::1 */
    String RATE_LIMIT_WHITELIST_IPS = "rate.limit.whitelist.ips";

    /** The key of the configuration. e.g.  */
    String RATE_LIMIT_BLOCKED_IPS = "rate.limit.blocked.ips";

import java.net.PasswordAuthentication;
import java.net.Proxy;
import java.net.Proxy.Type;
import java.net.SocketAddress;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Date;
import java.util.Enumeration;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Locale;
import java.util.Map;
import java.util.Set;

      maintains a hash table to track the most up-to-date vocabulary based on
      the inputs received by the layer and the eviction policy. When this layer
      is used with an `UpdateEmbeddingCallback`, which is a time-based callback,
      the vocabulary lookup tensor is updated at the time interval set in the
      `UpdateEmbeddingCallback` based on the most up-to-date vocabulary hash

   *
   * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
   * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
   * operates per-segment rather than globally for increased implementation simplicity. We expect
   * the cache hit rate to be similar to that of a global LRU algorithm.
   */

  // Constants

  /**

   *
   * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
   * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
   * operates per-segment rather than globally for increased implementation simplicity. We expect
   * the cache hit rate to be similar to that of a global LRU algorithm.
   */

  // Constants

  /**