mirror of
https://github.com/hanzoai/tasks.git
synced 2026-11-03 03:56:04 +00:00
## What changed? - Return ObsoleteMatchingTask when standalone activity dispatch task is obsolete. - Set a stamp on the state and tasks for validation of current attempt. - Dedupe matching requests by request ID. ## Why? Avoid retrying these tasks invalid tasks and fix idempotency issues.
56 lines
2.1 KiB
Go
56 lines
2.1 KiB
Go
package chasm
|
|
|
|
import (
|
|
"fmt"
|
|
"slices"
|
|
|
|
"go.temporal.io/api/serviceerror"
|
|
)
|
|
|
|
// ErrInvalidTransition is returned from [Transition.Apply] on an invalid state transition.
|
|
var ErrInvalidTransition = serviceerror.NewFailedPrecondition("invalid transition")
|
|
|
|
// A StateMachine is anything that can get and set a comparable state S and re-generate tasks based on current state.
|
|
// It is meant to be used with [Transition] objects to safely transition their state on a given event.
|
|
type StateMachine[S comparable] interface {
|
|
StateMachineState() S
|
|
SetStateMachineState(S)
|
|
}
|
|
|
|
// Transition represents a state machine transition for a machine of type SM with state S and event E.
|
|
type Transition[S comparable, SM StateMachine[S], E any] struct {
|
|
// Source states that are valid for this transition.
|
|
Sources []S
|
|
// Destination state to transition to.
|
|
Destination S
|
|
// Function to apply the transition. Mutate the state machine object here and schedule tasks.
|
|
apply func(SM, MutableContext, E) error
|
|
}
|
|
|
|
// NewTransition creates a new [Transition] from the given source states to a destination state for a given event.
|
|
// The apply function is called after verifying the transition is possible and setting the destination state.
|
|
func NewTransition[S comparable, SM StateMachine[S], E any](src []S, dst S, apply func(SM, MutableContext, E) error) Transition[S, SM, E] {
|
|
return Transition[S, SM, E]{
|
|
Sources: src,
|
|
Destination: dst,
|
|
apply: apply,
|
|
}
|
|
}
|
|
|
|
// Possible returns a boolean indicating whether the transition is possible for the current state.
|
|
func (t Transition[S, SM, E]) Possible(sm SM) bool {
|
|
return slices.Contains(t.Sources, sm.StateMachineState())
|
|
}
|
|
|
|
// Apply applies a transition event to the given state machine changing the state machine's state to the transition's
|
|
// Destination on success.
|
|
func (t Transition[S, SM, E]) Apply(sm SM, ctx MutableContext, event E) error {
|
|
prevState := sm.StateMachineState()
|
|
if !t.Possible(sm) {
|
|
return fmt.Errorf("%w from %v", ErrInvalidTransition, prevState)
|
|
}
|
|
|
|
sm.SetStateMachineState(t.Destination)
|
|
return t.apply(sm, ctx, event)
|
|
}
|