mirror of
https://github.com/hanzoai/tasks.git
synced 2026-11-03 03:56:04 +00:00
zeekay
5a601d081b
Full module path rebrand from Temporal to Hanzo Tasks: - go.mod module: github.com/hanzoai/tasks - All internal Go imports updated (1906 files) - cmd/server renamed to cmd/tasksd - Binary name: tasksd (was temporal-server) - Docker images: hanzoai/tasks (was temporalio/server) - README rewritten with Hanzo Tasks branding - LLM.md created with integration notes - Makefile, goreleaser, CI workflows updated - go.temporal.io/sdk and go.temporal.io/api imports preserved (separate repos) Fork of Temporal.io (MIT license).
194 lines
4.7 KiB
Go
194 lines
4.7 KiB
Go
package tests
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
"github.com/stretchr/testify/suite"
|
|
"github.com/hanzoai/tasks/common/persistence/sql/sqlplugin"
|
|
"github.com/hanzoai/tasks/common/primitives"
|
|
"github.com/hanzoai/tasks/common/shuffle"
|
|
)
|
|
|
|
type (
|
|
historyTreeSuite struct {
|
|
suite.Suite
|
|
*require.Assertions
|
|
|
|
store sqlplugin.HistoryTree
|
|
}
|
|
)
|
|
|
|
const (
|
|
testHistoryTreeEncoding = "random encoding"
|
|
)
|
|
|
|
var (
|
|
testHistoryTreeData = []byte("random history tree data")
|
|
)
|
|
|
|
func NewHistoryTreeSuite(
|
|
t *testing.T,
|
|
store sqlplugin.HistoryTree,
|
|
) *historyTreeSuite {
|
|
return &historyTreeSuite{
|
|
Assertions: require.New(t),
|
|
store: store,
|
|
}
|
|
}
|
|
|
|
func (s *historyTreeSuite) SetupSuite() {
|
|
|
|
}
|
|
|
|
func (s *historyTreeSuite) TearDownSuite() {
|
|
|
|
}
|
|
|
|
func (s *historyTreeSuite) SetupTest() {
|
|
s.Assertions = require.New(s.T())
|
|
}
|
|
|
|
func (s *historyTreeSuite) TearDownTest() {
|
|
|
|
}
|
|
|
|
func (s *historyTreeSuite) TestInsert_Success() {
|
|
shardID := rand.Int31()
|
|
treeID := primitives.NewUUID()
|
|
branchID := primitives.NewUUID()
|
|
|
|
node := s.newRandomTreeRow(shardID, treeID, branchID)
|
|
result, err := s.store.InsertIntoHistoryTree(newExecutionContext(), &node)
|
|
s.NoError(err)
|
|
rowsAffected, err := result.RowsAffected()
|
|
s.NoError(err)
|
|
s.Equal(1, int(rowsAffected))
|
|
}
|
|
|
|
func (s *historyTreeSuite) TestInsert_Duplicate_Success() {
|
|
shardID := rand.Int31()
|
|
treeID := primitives.NewUUID()
|
|
branchID := primitives.NewUUID()
|
|
|
|
node := s.newRandomTreeRow(shardID, treeID, branchID)
|
|
result, err := s.store.InsertIntoHistoryTree(newExecutionContext(), &node)
|
|
s.NoError(err)
|
|
rowsAffected, err := result.RowsAffected()
|
|
s.NoError(err)
|
|
s.Equal(1, int(rowsAffected))
|
|
|
|
node = s.newRandomTreeRow(shardID, treeID, branchID)
|
|
result, err = s.store.InsertIntoHistoryTree(newExecutionContext(), &node)
|
|
s.NoError(err)
|
|
_, err = result.RowsAffected()
|
|
s.NoError(err)
|
|
// TODO cannot assert on the number of rows affect
|
|
// since MySQL and PostgreSQL have different behavior
|
|
}
|
|
|
|
func (s *historyTreeSuite) TestInsertSelect() {
|
|
shardID := rand.Int31()
|
|
treeID := primitives.NewUUID()
|
|
branchID := primitives.NewUUID()
|
|
|
|
tree := s.newRandomTreeRow(shardID, treeID, branchID)
|
|
result, err := s.store.InsertIntoHistoryTree(newExecutionContext(), &tree)
|
|
s.NoError(err)
|
|
rowsAffected, err := result.RowsAffected()
|
|
s.NoError(err)
|
|
s.Equal(1, int(rowsAffected))
|
|
|
|
selectFilter := sqlplugin.HistoryTreeSelectFilter{
|
|
ShardID: shardID,
|
|
TreeID: treeID,
|
|
}
|
|
rows, err := s.store.SelectFromHistoryTree(newExecutionContext(), selectFilter)
|
|
s.NoError(err)
|
|
for index := range rows {
|
|
rows[index].ShardID = shardID
|
|
rows[index].TreeID = treeID
|
|
}
|
|
s.Equal([]sqlplugin.HistoryTreeRow{tree}, rows)
|
|
}
|
|
|
|
func (s *historyTreeSuite) TestDeleteSelect() {
|
|
shardID := rand.Int31()
|
|
treeID := primitives.NewUUID()
|
|
branchID := primitives.NewUUID()
|
|
|
|
deleteFilter := sqlplugin.HistoryTreeDeleteFilter{
|
|
ShardID: shardID,
|
|
TreeID: treeID,
|
|
BranchID: branchID,
|
|
}
|
|
result, err := s.store.DeleteFromHistoryTree(newExecutionContext(), deleteFilter)
|
|
s.NoError(err)
|
|
rowsAffected, err := result.RowsAffected()
|
|
s.NoError(err)
|
|
s.Equal(0, int(rowsAffected))
|
|
|
|
selectFilter := sqlplugin.HistoryTreeSelectFilter{
|
|
ShardID: shardID,
|
|
TreeID: treeID,
|
|
}
|
|
rows, err := s.store.SelectFromHistoryTree(newExecutionContext(), selectFilter)
|
|
s.NoError(err)
|
|
for index := range rows {
|
|
rows[index].ShardID = shardID
|
|
rows[index].TreeID = treeID
|
|
}
|
|
s.Equal([]sqlplugin.HistoryTreeRow(nil), rows)
|
|
}
|
|
|
|
func (s *historyTreeSuite) TestInsertDeleteSelect() {
|
|
shardID := rand.Int31()
|
|
treeID := primitives.NewUUID()
|
|
branchID := primitives.NewUUID()
|
|
|
|
tree := s.newRandomTreeRow(shardID, treeID, branchID)
|
|
result, err := s.store.InsertIntoHistoryTree(newExecutionContext(), &tree)
|
|
s.NoError(err)
|
|
rowsAffected, err := result.RowsAffected()
|
|
s.NoError(err)
|
|
s.Equal(1, int(rowsAffected))
|
|
|
|
deleteFilter := sqlplugin.HistoryTreeDeleteFilter{
|
|
ShardID: shardID,
|
|
TreeID: treeID,
|
|
BranchID: branchID,
|
|
}
|
|
result, err = s.store.DeleteFromHistoryTree(newExecutionContext(), deleteFilter)
|
|
s.NoError(err)
|
|
rowsAffected, err = result.RowsAffected()
|
|
s.NoError(err)
|
|
s.Equal(1, int(rowsAffected))
|
|
|
|
selectFilter := sqlplugin.HistoryTreeSelectFilter{
|
|
ShardID: shardID,
|
|
TreeID: treeID,
|
|
}
|
|
rows, err := s.store.SelectFromHistoryTree(newExecutionContext(), selectFilter)
|
|
s.NoError(err)
|
|
for index := range rows {
|
|
rows[index].ShardID = shardID
|
|
rows[index].TreeID = treeID
|
|
}
|
|
s.Equal([]sqlplugin.HistoryTreeRow(nil), rows)
|
|
}
|
|
|
|
func (s *historyTreeSuite) newRandomTreeRow(
|
|
shardID int32,
|
|
treeID primitives.UUID,
|
|
branchID primitives.UUID,
|
|
) sqlplugin.HistoryTreeRow {
|
|
return sqlplugin.HistoryTreeRow{
|
|
ShardID: shardID,
|
|
TreeID: treeID,
|
|
BranchID: branchID,
|
|
Data: shuffle.Bytes(testHistoryTreeData),
|
|
DataEncoding: testHistoryTreeEncoding,
|
|
}
|
|
}
|