1. import java.util.HashMap;
  2. import java.util.Map;
  4. public class RateLimitedEntry {
  6. private final int maxRequests;
  7. private final long windowMs;
  8. private final Map<String, Integer> requestCounts;
  10. public RateLimitedEntry(int maxRequests, long windowMs) {
  11. this.maxRequests = maxRequests;
  12. this.windowMs = windowMs;
  13. this.requestCounts = new HashMap<>();
  14. }
  16. public synchronized boolean allowRequest(String identifier) {
  17. // Get the current time
  18. long currentTime = System.currentTimeMillis();
  20. // Reset counts if outside the window
  21. requestCounts.remove(identifier);
  22. requestCounts.put(identifier, 0);
  25. // Check if the identifier has exceeded the limit
  26. if (requestCounts.get(identifier) >= maxRequests) {
  27. return false; // Rate limit exceeded
  28. }
  30. // Increment the request count for this identifier
  31. requestCounts.put(identifier, requestCounts.get(identifier) + 1);
  32. return true; // Request allowed
  33. }
  35. public synchronized void resetCounts(String identifier) {
  36. requestCounts.remove(identifier);
  37. }
  39. public int getRemainingRequests(String identifier) {
  40. if(requestCounts.containsKey(identifier)) {
  41. return maxRequests - requestCounts.get(identifier);
  42. }
  43. return maxRequests;
  44. }
  45. }

Add your comment