dlq

Documentation

Index

• type DLQ
  • func NewDLQ[T any]() *DLQ[T]
  • func NewDLQWithDelay[T any](retryDelay func(retries int) time.Duration) *DLQ[T]
  • func (dlq *DLQ[T]) AddItem(item T, retries int)
  • func (dlq *DLQ[T]) AddItemHighPriority(item T)
  • func (dlq *DLQ[T]) GetNextItem() (value *Item[T], ok bool)
  • func (dlq *DLQ[T]) Size() int
• type Item
  • func MapItem[T, U any](b Item[T], mapper func(T) U) Item[U]
• type RetryStrategy
  • func RetryDelayLinear(backoff time.Duration) RetryStrategy

Types

type DLQ

type DLQ[T any] struct {
	// contains filtered or unexported fields
}

func NewDLQ

func NewDLQ[T any]() *DLQ[T]

func NewDLQWithDelay

func NewDLQWithDelay[T any](retryDelay func(retries int) time.Duration) *DLQ[T]

func (*DLQ[T]) AddItem

func (dlq *DLQ[T]) AddItem(item T, retries int)

func (*DLQ[T]) AddItemHighPriority

func (dlq *DLQ[T]) AddItemHighPriority(item T)

func (*DLQ[T]) GetNextItem

func (dlq *DLQ[T]) GetNextItem() (value *Item[T], ok bool)

func (*DLQ[T]) Size

func (dlq *DLQ[T]) Size() int

type Item

type Item[T any] struct {
	Value   T
	Retries int
	// contains filtered or unexported fields
}

Item This is generic so that metadata about retries can be maintained in an envelope during processing for when an item needs to make its way back onto the DLQ later

func MapItem

func MapItem[T, U any](b Item[T], mapper func(T) U) Item[U]

type RetryStrategy

type RetryStrategy func(retries int) time.Duration

RetryStrategy takes the number of retries and returns a Duration. This allows the caller to implement any strategy they like, be it constant, linear, exponential, etc.

func RetryDelayLinear

func RetryDelayLinear(backoff time.Duration) RetryStrategy