How do I implement a token bucket algorithm in code?

How do I implement a token bucket algorithm in code?

To implement a token bucket algorithm, you need to define the bucket's capacity and the rate at which tokens are added.

Can you provide a sample code in Python?

Sure! Here's a simple implementation in Python:

import time

class TokenBucket:
    def __init__(self, capacity, fill_rate):
        self.capacity = capacity
        self.fill_rate = fill_rate
        self.tokens = capacity
        self.last_fill_time = time.time()

    def add_tokens(self):
        now = time.time()
        elapsed = now - self.last_fill_time
        new_tokens = elapsed * self.fill_rate
        self.tokens = min(self.capacity, self.tokens + new_tokens)
        self.last_fill_time = now

    def get_token(self):
        self.add_tokens()
        if self.tokens >= 1:
            self.tokens -= 1
            return True
        return False

# Example usage:
bucket = TokenBucket(10, 1)  # 10 tokens capacity, 1 token per second
while True:
    if bucket.get_token():
        print("Token acquired!")
    else:
        print("No tokens available.")
    time.sleep(1)

What if I want to adjust the fill rate dynamically?

You can modify the fill_rate attribute of the TokenBucket class at any time, and then call add_tokens() to update the token count accordingly.