mirror of
https://github.com/hanzoai/tasks.git
synced 2026-10-30 14:56:19 +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`.
303 lines
6.9 KiB
Go
303 lines
6.9 KiB
Go
package queues
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
"github.com/stretchr/testify/suite"
|
|
"go.temporal.io/server/service/history/tasks"
|
|
)
|
|
|
|
type (
|
|
rangeSuite struct {
|
|
suite.Suite
|
|
*require.Assertions
|
|
}
|
|
)
|
|
|
|
func TestRangeSuite(t *testing.T) {
|
|
s := new(rangeSuite)
|
|
suite.Run(t, s)
|
|
}
|
|
|
|
func (s *rangeSuite) SetupTest() {
|
|
s.Assertions = require.New(s.T())
|
|
}
|
|
|
|
func (s *rangeSuite) TestNewRange_Invalid() {
|
|
minKey := NewRandomKey()
|
|
maxKey := tasks.NewKey(
|
|
time.Unix(0, minKey.FireTime.UnixNano()-1),
|
|
minKey.TaskID,
|
|
)
|
|
s.Panics(func() { NewRange(minKey, maxKey) })
|
|
|
|
maxKey = tasks.NewKey(minKey.FireTime, minKey.TaskID-1)
|
|
s.Panics(func() { NewRange(minKey, maxKey) })
|
|
}
|
|
|
|
func (s *rangeSuite) TestNewRange_Valid() {
|
|
minKey := NewRandomKey()
|
|
_ = NewRange(minKey, minKey)
|
|
|
|
maxKey := tasks.NewKey(
|
|
time.Unix(0, minKey.FireTime.UnixNano()+1),
|
|
minKey.TaskID,
|
|
)
|
|
_ = NewRange(minKey, maxKey)
|
|
|
|
maxKey = tasks.NewKey(minKey.FireTime, minKey.TaskID+1)
|
|
_ = NewRange(minKey, maxKey)
|
|
|
|
maxKey = tasks.NewKey(
|
|
time.Unix(0, minKey.FireTime.UnixNano()+1),
|
|
minKey.TaskID-1,
|
|
)
|
|
_ = NewRange(minKey, maxKey)
|
|
}
|
|
|
|
func (s *rangeSuite) TestIsEmpty() {
|
|
minKey := NewRandomKey()
|
|
r := NewRange(minKey, minKey)
|
|
s.True(r.IsEmpty())
|
|
|
|
maxKey := tasks.NewKey(
|
|
time.Unix(0, minKey.FireTime.UnixNano()+1),
|
|
minKey.TaskID,
|
|
)
|
|
r = NewRange(minKey, maxKey)
|
|
s.False(r.IsEmpty())
|
|
|
|
maxKey = tasks.NewKey(minKey.FireTime, minKey.TaskID+1)
|
|
r = NewRange(minKey, maxKey)
|
|
s.False(r.IsEmpty())
|
|
|
|
maxKey = tasks.NewKey(
|
|
time.Unix(0, minKey.FireTime.UnixNano()+1),
|
|
minKey.TaskID-1,
|
|
)
|
|
r = NewRange(minKey, maxKey)
|
|
s.False(r.IsEmpty())
|
|
}
|
|
|
|
func (s *rangeSuite) TestContainsKey_EmptyRange() {
|
|
key := NewRandomKey()
|
|
r := NewRange(key, key)
|
|
|
|
testKey := key
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(key.FireTime.Add(time.Nanosecond), key.TaskID)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(key.FireTime.Add(-time.Nanosecond), key.TaskID)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(key.FireTime, key.TaskID-1)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(key.FireTime, key.TaskID+1)
|
|
s.False(r.ContainsKey(testKey))
|
|
}
|
|
|
|
func (s *rangeSuite) TestContainsKey_NonEmptyRange() {
|
|
r := NewRandomRange()
|
|
|
|
testKey := r.InclusiveMin
|
|
s.True(r.ContainsKey(testKey))
|
|
|
|
testKey = r.ExclusiveMax
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(r.InclusiveMin.FireTime.Add(-time.Nanosecond), r.InclusiveMin.TaskID)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(r.InclusiveMin.FireTime, r.InclusiveMin.TaskID-1)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(r.ExclusiveMax.FireTime.Add(time.Nanosecond), r.ExclusiveMax.TaskID)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
testKey = tasks.NewKey(r.ExclusiveMax.FireTime, r.ExclusiveMax.TaskID+1)
|
|
s.False(r.ContainsKey(testKey))
|
|
|
|
for i := 0; i != 1000; i++ {
|
|
s.True(r.ContainsKey(NewRandomKeyInRange(r)))
|
|
}
|
|
}
|
|
|
|
func (s *rangeSuite) TestContainsRange_EmptyRange() {
|
|
r := NewRandomRange()
|
|
s.True(r.ContainsRange(NewRange(r.InclusiveMin, r.InclusiveMin)))
|
|
s.True(r.ContainsRange(NewRange(r.ExclusiveMax, r.ExclusiveMax)))
|
|
|
|
key := NewRandomKey()
|
|
r = NewRange(key, key)
|
|
s.True(r.ContainsRange(r))
|
|
|
|
s.False(r.ContainsRange(NewRandomRange()))
|
|
}
|
|
|
|
func (s *rangeSuite) TestContainsRange_NonEmptyRange() {
|
|
r := NewRandomRange()
|
|
|
|
testRange := r
|
|
s.True(r.ContainsRange(testRange))
|
|
|
|
testRange = NewRange(
|
|
tasks.NewKey(r.InclusiveMin.FireTime, r.InclusiveMin.TaskID+1),
|
|
r.ExclusiveMax,
|
|
)
|
|
s.True(r.ContainsRange(testRange))
|
|
s.False(testRange.ContainsRange(r))
|
|
|
|
testRange = NewRange(
|
|
r.InclusiveMin,
|
|
tasks.NewKey(r.ExclusiveMax.FireTime, r.ExclusiveMax.TaskID+1),
|
|
)
|
|
s.False(r.ContainsRange(testRange))
|
|
s.True(testRange.ContainsRange(r))
|
|
|
|
testRange = NewRange(
|
|
NewRandomKeyInRange(r),
|
|
r.ExclusiveMax,
|
|
)
|
|
s.True(r.ContainsRange(testRange))
|
|
s.False(testRange.ContainsRange(r))
|
|
|
|
testRange = NewRange(
|
|
r.InclusiveMin,
|
|
NewRandomKeyInRange(r),
|
|
)
|
|
s.True(r.ContainsRange(testRange))
|
|
s.False(testRange.ContainsRange(r))
|
|
}
|
|
|
|
func (s *rangeSuite) TestCanSplit() {
|
|
key := NewRandomKey()
|
|
ranges := []Range{
|
|
NewRandomRange(),
|
|
NewRange(key, key),
|
|
}
|
|
|
|
for _, r := range ranges {
|
|
testKey := r.InclusiveMin
|
|
s.True(r.CanSplit(testKey))
|
|
|
|
testKey = r.ExclusiveMax
|
|
s.True(r.CanSplit(testKey))
|
|
|
|
if !r.IsEmpty() {
|
|
for i := 0; i != 1000; i++ {
|
|
s.True(r.CanSplit(NewRandomKeyInRange(r)))
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func (s *rangeSuite) TestCanMerge() {
|
|
key := NewRandomKey()
|
|
ranges := []Range{
|
|
NewRandomRange(),
|
|
NewRange(key, key),
|
|
}
|
|
|
|
for _, r := range ranges {
|
|
if !r.IsEmpty() {
|
|
testRange := NewRange(
|
|
tasks.MinimumKey,
|
|
NewRandomKeyInRange(r),
|
|
)
|
|
s.True(r.CanMerge(testRange))
|
|
s.True(testRange.CanMerge(r))
|
|
|
|
testRange = NewRange(
|
|
NewRandomKeyInRange(r),
|
|
tasks.MaximumKey,
|
|
)
|
|
s.True(r.CanMerge(testRange))
|
|
s.True(testRange.CanMerge(r))
|
|
}
|
|
|
|
testRange := NewRange(
|
|
tasks.MinimumKey,
|
|
tasks.MaximumKey,
|
|
)
|
|
s.True(r.CanMerge(testRange))
|
|
s.True(testRange.CanMerge(r))
|
|
|
|
testRange = NewRange(
|
|
tasks.MinimumKey,
|
|
r.InclusiveMin,
|
|
)
|
|
s.True(r.CanMerge(testRange))
|
|
s.True(testRange.CanMerge(r))
|
|
|
|
testRange = NewRange(
|
|
r.ExclusiveMax,
|
|
tasks.MaximumKey,
|
|
)
|
|
s.True(r.CanMerge(testRange))
|
|
s.True(testRange.CanMerge(r))
|
|
|
|
testRange = NewRange(
|
|
tasks.MinimumKey,
|
|
tasks.NewKey(r.InclusiveMin.FireTime, r.InclusiveMin.TaskID-1),
|
|
)
|
|
s.False(r.CanMerge(testRange))
|
|
s.False(testRange.CanMerge(r))
|
|
|
|
testRange = NewRange(
|
|
tasks.NewKey(r.ExclusiveMax.FireTime, r.ExclusiveMax.TaskID+1),
|
|
tasks.MaximumKey,
|
|
)
|
|
s.False(r.CanMerge(testRange))
|
|
s.False(testRange.CanMerge(r))
|
|
}
|
|
}
|
|
|
|
func (s *rangeSuite) TestSplit() {
|
|
r := NewRandomRange()
|
|
splitKey := NewRandomKeyInRange(r)
|
|
|
|
left, right := r.Split(splitKey)
|
|
s.True(left.Equals(NewRange(r.InclusiveMin, splitKey)))
|
|
s.True(right.Equals(NewRange(splitKey, r.ExclusiveMax)))
|
|
}
|
|
|
|
func (s *rangeSuite) TestMerge() {
|
|
r := NewRandomRange()
|
|
|
|
testRange := NewRange(
|
|
tasks.MinimumKey,
|
|
NewRandomKeyInRange(r),
|
|
)
|
|
mergedRange := r.Merge(testRange)
|
|
s.True(mergedRange.Equals(testRange.Merge(r)))
|
|
s.True(mergedRange.Equals(NewRange(tasks.MinimumKey, r.ExclusiveMax)))
|
|
|
|
testRange = NewRange(
|
|
NewRandomKeyInRange(r),
|
|
tasks.MaximumKey,
|
|
)
|
|
mergedRange = r.Merge(testRange)
|
|
s.True(mergedRange.Equals(testRange.Merge(r)))
|
|
s.True(mergedRange.Equals(NewRange(r.InclusiveMin, tasks.MaximumKey)))
|
|
|
|
testRange = NewRange(tasks.MinimumKey, tasks.MaximumKey)
|
|
mergedRange = r.Merge(testRange)
|
|
s.True(mergedRange.Equals(testRange.Merge(r)))
|
|
s.True(mergedRange.Equals(NewRange(tasks.MinimumKey, tasks.MaximumKey)))
|
|
|
|
testRange = NewRange(tasks.MinimumKey, r.InclusiveMin)
|
|
mergedRange = r.Merge(testRange)
|
|
s.True(mergedRange.Equals(testRange.Merge(r)))
|
|
s.True(mergedRange.Equals(NewRange(tasks.MinimumKey, r.ExclusiveMax)))
|
|
|
|
testRange = NewRange(r.ExclusiveMax, tasks.MaximumKey)
|
|
mergedRange = r.Merge(testRange)
|
|
s.True(mergedRange.Equals(testRange.Merge(r)))
|
|
s.True(mergedRange.Equals(NewRange(r.InclusiveMin, tasks.MaximumKey)))
|
|
}
|