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`.
146 lines
2.7 KiB
Go
146 lines
2.7 KiB
Go
package collection_test
|
|
|
|
import (
|
|
"sync"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
"go.temporal.io/server/common/collection"
|
|
)
|
|
|
|
// This isn't exhaustive but serves as a basic stress test to ensure our implementation is collection
|
|
func TestMap_MultiThreaded(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
var wg sync.WaitGroup
|
|
barrier := make(chan struct{})
|
|
wg.Add(5)
|
|
go func() {
|
|
defer wg.Done()
|
|
<-barrier
|
|
for i := 0; i < 1000; i++ {
|
|
m.Set(i, i)
|
|
}
|
|
}()
|
|
go func() {
|
|
<-barrier
|
|
defer wg.Done()
|
|
for i := 0; i < 1000; i++ {
|
|
m.Get(i)
|
|
}
|
|
}()
|
|
go func() {
|
|
<-barrier
|
|
defer wg.Done()
|
|
for i := 0; i < 1000; i++ {
|
|
m.GetOrSet(i, i)
|
|
}
|
|
}()
|
|
go func() {
|
|
<-barrier
|
|
defer wg.Done()
|
|
for i := 0; i < 1000; i++ {
|
|
m.Pop(i)
|
|
}
|
|
}()
|
|
go func() {
|
|
<-barrier
|
|
defer wg.Done()
|
|
for i := 0; i < 1000; i++ {
|
|
m.PopAll()
|
|
}
|
|
}()
|
|
close(barrier)
|
|
wg.Wait()
|
|
}
|
|
|
|
func TestMap_Get(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
m.Set(1, 1)
|
|
v, ok := m.Get(1)
|
|
if !ok {
|
|
t.Error("Expected true, got false")
|
|
}
|
|
if v != 1 {
|
|
t.Errorf("Expected 1, got %v", v)
|
|
}
|
|
}
|
|
|
|
func TestMap_GetOrSet(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
m.Set(1, 1)
|
|
v, ok := m.GetOrSet(1, 2)
|
|
assert.True(t, ok, "expected exist key")
|
|
assert.Equal(t, 1, v, "expected the existing value")
|
|
|
|
v, ok = m.GetOrSet(2, 2)
|
|
assert.False(t, ok, "expected non exist key")
|
|
assert.Equal(t, 2, v, "expected the new set value")
|
|
|
|
v, ok = m.Get(2)
|
|
assert.True(t, ok, "expected exist key")
|
|
assert.Equal(t, 2, v, "expected the existing value")
|
|
}
|
|
|
|
func TestMap_Delete(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
m.Set(1, 1)
|
|
m.Set(2, 1)
|
|
m.Delete(1)
|
|
_, ok := m.Get(1)
|
|
if ok {
|
|
t.Error("Expected false, got true")
|
|
}
|
|
v, ok := m.Get(2)
|
|
if !ok {
|
|
t.Error("Expected true, got false")
|
|
}
|
|
if v != 1 {
|
|
t.Errorf("Expected 1, got %v", v)
|
|
}
|
|
}
|
|
|
|
func TestMap_Pop_ReturnsFalseWhenKeyDoesNotExist(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
_, ok := m.Pop(1)
|
|
if ok {
|
|
t.Error("Expected false, got true")
|
|
}
|
|
}
|
|
|
|
func TestMap_Pop_ReturnsTrueWhenKeyExists(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
m.Set(1, 1)
|
|
v, ok := m.Pop(1)
|
|
if !ok {
|
|
t.Error("Expected true, got false")
|
|
}
|
|
if v != 1 {
|
|
t.Errorf("Expected 1, got %v", v)
|
|
}
|
|
}
|
|
|
|
func TestMap_PopAll(t *testing.T) {
|
|
m := collection.NewSyncMap[int, int]()
|
|
values := m.PopAll()
|
|
assert.Equal(t, 0, len(values))
|
|
|
|
m.Set(1, 1)
|
|
m.Set(2, 2)
|
|
m.Set(3, 3)
|
|
m.Set(4, 4)
|
|
m.Pop(4)
|
|
|
|
mCopy := m
|
|
|
|
values = m.PopAll()
|
|
assert.Equal(t, 3, len(values))
|
|
sum := 0
|
|
for _, v := range values {
|
|
sum += v
|
|
}
|
|
assert.Equal(t, 6, sum)
|
|
|
|
_, ok := mCopy.Get(3)
|
|
assert.False(t, ok, "SyncMap is not correctly copyable")
|
|
}
|