File size: 1,610 Bytes
7107f0b |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 |
package tache
import (
"runtime"
"sync"
"time"
)
// sliceContains checks if a slice contains a value
func sliceContains[T comparable](slice []T, v T) bool {
for _, vv := range slice {
if vv == v {
return true
}
}
return false
}
// getCurrentGoroutineStack get current goroutine stack
func getCurrentGoroutineStack() string {
buf := make([]byte, 1<<16)
n := runtime.Stack(buf, false)
return string(buf[:n])
}
// newDebounce returns a debounced function
func newDebounce(f func(), interval time.Duration) func() {
var timer *time.Timer
var lock sync.Mutex
return func() {
lock.Lock()
defer lock.Unlock()
if timer == nil {
timer = time.AfterFunc(interval, f)
} else {
timer.Reset(interval)
}
}
}
// isRetry checks if a task is retry executed
func isRetry[T Task](task T) bool {
return task.GetState() == StateWaitingRetry
}
// isLastRetry checks if a task is last retry
func isLastRetry[T Task](task T) bool {
retry, maxRetry := task.GetRetry()
return retry >= maxRetry
}
// needRetry judge whether the task need retry
func needRetry[T Task](task T) bool {
// if task is not recoverable, return false
if !IsRecoverable(task.GetErr()) {
return false
}
// if task is not retryable, return false
if r, ok := Task(task).(Retryable); ok && !r.Retryable() {
return false
}
// only retry when task is errored or failed
if sliceContains([]State{StateErrored, StateFailed}, task.GetState()) {
retry, maxRetry := task.GetRetry()
if retry < maxRetry {
task.SetRetry(retry+1, maxRetry)
task.SetState(StateWaitingRetry)
return true
}
}
return false
}
|