API Reference plug_ratelimit v0.21.37
Modules
In number theory, the Stern–Brocot tree is an infinite complete binary tree in which the vertices correspond one-for-one to the positive rational numbers, whose values are ordered from the left to the right as in a search tree.
A Token Bucket fills with tokens at a regular rate, up until a preset limit. Another process may ask if the bucket is empty or not. Each empty request drains a token from the bucket.
A plug that enforces rate limiting (requests per second)