mirror of
https://github.com/hanzoai/tasks.git
synced 2026-10-04 02:04:03 +00:00
Alex ShtinandGitHub
8e8f1b0f7c
## What changed?
<!-- Describe what has changed in this PR -->
Remove license header from every file. Because it is really hard to
follow in this PR here is the summary:
1. License header is removed from all `.go` and `.proto` files
:fireworks::fireworks:🎆.
2. `LICENSE` file in the root directory has only Temporal and Uber
copyrights.
3. 5 other `LICENSE` files added to the packages which have copyrights
different from Temporal and Uber: Datadog, Xargin, "Mat Ryer, Tyler
Bunnell and contributors".
4. `license_file` flag is removed from all code generation tools.
5. `copyright_file` flag is removed from `go:generate mockgen`
directive.
6. All copyright related targets are removed from `Makefile`.
7. Updated Temporal copyright year to 2025 everywhere.
## Why?
<!-- Tell your future self why have you made these changes -->
I double checked with legal department that it is not needed to have
license header in every file. One file per repo is enough. I put all
copyrights to the root `LICENSE` file and removed header from all other
files. Also updated tools and `Makefile`.
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"
|
|
"go.temporal.io/server/common/persistence/sql/sqlplugin"
|
|
"go.temporal.io/server/common/primitives"
|
|
"go.temporal.io/server/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,
|
|
}
|
|
}
|