This is stars and forks stats for /uber-go/ratelimit repository. As of 09 May, 2024 this repository has 3899 stars and 287 forks.
Go rate limiter This package provides a Golang implementation of the leaky-bucket rate limit algorithm. This implementation refills the bucket based on the time elapsed between requests instead of requiring an interval clock to fill the bucket discretely. Create a rate limiter with a maximum number of operations to perform per second. Call Take() before each operation. Take will sleep until you can continue. import ( "fmt" "time" "go.uber.org/ratelimit" ) func main() { rl := ratelimit.New(100)...
Go rate limiter This package provides a Golang implementation of the leaky-bucket rate limit algorithm. This implementation refills the bucket based on the time elapsed between requests instead of requiring an interval clock to fill the bucket discretely. Create a rate limiter with a maximum number of operations to perform per second. Call Take() before each operation. Take will sleep until you can continue. import ( "fmt" "time" "go.uber.org/ratelimit" ) func main() { rl := ratelimit.New(100)...
repo | techs | stars | weekly | forks | weekly |
---|---|---|---|---|---|
jmid/mutaml | OCamlShellMakefile | 56 | 0 | 3 | 0 |
Forethought-Technologies/AutoChain | PythonMakefile | 1.5k | 0 | 76 | 0 |
pearsonca/hbmPRNG | RC++Makefile | 1 | 0 | 0 | 0 |
luvit/luvit | LuaGoOther | 3.7k | +8 | 389 | 0 |
remonbonbon/makefile-example | MakefileC++C | 41 | 0 | 69 | +1 |
stdlib-js/string-base-first-code-point | MakefileJavaScript | 1 | 0 | 0 | 0 |
stdlib-js/string-base-first-grapheme-cluster | MakefileJavaScript | 1 | 0 | 0 | 0 |
ryan4yin/nix-darwin-kickstarter | NixMakefilePython | 93 | +11 | 5 | +1 |
janestreet/ppxlib_jane | OCamlShellMakefile | 1 | 0 | 0 | 0 |
a16z-infra/cog-llama-template | PythonJupyter NotebookMakefile | 261 | 0 | 38 | 0 |