#include #include #include #include #include class RateLimiter { private: std::queue requestTimestamps; // Queue to store timestamps of requests const long ttl; // Time window in milliseconds const long limit; // Maximum requests allowed in the window std::mutex mtx; public: RateLimiter(long ttl, long limit) : ttl(ttl), limit(limit) { } bool allowRequest() { std::lock_guard lock(mtx); long currentTime = std::chrono::duration_cast( std::chrono::system_clock::now().time_since_epoch()).count(); // Remove timestamps that are outside the sliding window while (!requestTimestamps.empty() && requestTimestamps.front() <= currentTime - ttl) { requestTimestamps.pop(); } // Check if we can allow a new request if (requestTimestamps.size() < limit) { requestTimestamps.push(currentTime); // Add current timestamp to the queue return true; } return false; } static void test1() { std::cout << "========= Test 1 =========" << std::endl; RateLimiter rateLimiter(1000, 5); // Make 11 requests at a rate faster than the rate limiter allows for (int i = 0; i < 11; i++) { std::cout << "Request " << (i + 1) << " accepted (t=" << (i * 100) << "ms)? : " << (rateLimiter.allowRequest() ? "true" : "false") << std::endl; std::this_thread::sleep_for(std::chrono::milliseconds(100)); // Sleep for 100 milliseconds between requests } } static void test2() { std::cout << "\n========= Test 2 =========" << std::endl; RateLimiter rateLimiter(1000, 5); // Make 10 requests at a rate slower than the rate limiter allows for (int i = 0; i < 10; i++) { std::cout << "Request " << (i + 1) << " accepted (t=" << (i * 300) << "ms)? : " << (rateLimiter.allowRequest() ? "true" : "false") << std::endl; std::this_thread::sleep_for(std::chrono::milliseconds(300)); // Sleep for 300 milliseconds between requests } } }; int main() { RateLimiter::test1(); RateLimiter::test2(); return 0; }

Ask AI Assistant