https://github.com/codesoap/backoff
A most simple and flexible exponential backoff implementation for Go
https://github.com/codesoap/backoff
error-handling exponential-backoff minimal rate-limiting
Last synced: 8 months ago
JSON representation
A most simple and flexible exponential backoff implementation for Go
- Host: GitHub
- URL: https://github.com/codesoap/backoff
- Owner: codesoap
- License: mit
- Created: 2025-02-26T16:40:42.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2025-04-24T14:05:30.000Z (about 1 year ago)
- Last Synced: 2025-05-17T09:11:24.364Z (about 1 year ago)
- Topics: error-handling, exponential-backoff, minimal, rate-limiting
- Language: Go
- Homepage:
- Size: 7.81 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
This is a minimalist exponential backoff implementation for Go. It
focuses on absolute simplicity and only contains two functions, of which
you may not even need the second one.
It provides high performance and does not use floating-point arithmetic.
See https://pkg.go.dev/github.com/codesoap/backoff for the full
documentation.
# Usage
Here is a simple example; more can be found in
[the documentation](https://pkg.go.dev/github.com/codesoap/backoff):
```go
package main
import (
"fmt"
"github.com/codesoap/backoff"
)
func myActionThatMightFail() bool {
// Emulate an action that always fails for demonstration purposes:
return false
}
func main() {
limiter := &backoff.FailLimiter{}
for i := 1; i <= 12; i++ {
tried := limiter.Try(myActionThatMightFail)
if tried {
fmt.Printf("#%02d: Executed action.\n", i)
} else {
fmt.Printf("#%02d: Skipped action.\n", i)
}
}
// Output:
// #01: Executed action.
// #02: Skipped action.
// #03: Executed action.
// #04: Skipped action.
// #05: Skipped action.
// #06: Executed action.
// #07: Skipped action.
// #08: Skipped action.
// #09: Skipped action.
// #10: Skipped action.
// #11: Executed action.
// #12: Skipped action.
}
```