Last active
May 20, 2022 17:39
Looking for races
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package quamina | |
import ( | |
"fmt" | |
"log" | |
"math/rand" | |
"sync" | |
"testing" | |
) | |
func TestConcurrencyCore(t *testing.T) { | |
testConcurrency(t, NewCoreMatcher()) | |
} | |
func testConcurrency(t *testing.T, m Matcher) { | |
var ( | |
goroutines = 4 | |
n = 500 | |
tasks = 6 | |
) | |
log.Printf("TestConcurrency %T goroutines: %d, tasks: %d", | |
m, goroutines, tasks) | |
populate := func() { | |
for i := 0; i < n; i++ { | |
p := fmt.Sprintf(`{"like":["tacos","queso"],"want":[%d]}`, i) | |
if err := m.AddPattern(i, p); err != nil { | |
t.Fatal(err) | |
} | |
} | |
} | |
// depopulate := func() { | |
// for i := 0; i < n; i += 2 { | |
// if err := m.DeletePattern(i); err != nil { | |
// t.Fatal(err) | |
// } | |
// } | |
// } | |
query := func(verify bool) { | |
f := NewFJ(m.(*CoreMatcher)) | |
for i := 0; i < n; i++ { | |
e := fmt.Sprintf(`{"like":"tacos","want":%d}`, i) | |
fs, err := f.Flatten([]byte(e)) | |
if err != nil { | |
t.Fatal(err) | |
} | |
if got, err := m.MatchesForFields(fs); err != nil { | |
t.Fatal(err) | |
} else if verify && len(got) != 1 { | |
t.Fatal(got) | |
} | |
} | |
} | |
wg := sync.WaitGroup{} | |
for i := 0; i < goroutines; i++ { | |
wg.Add(1) | |
go func(i int) { | |
// We defer to get Done called after a t.Fatal(). | |
defer wg.Done() | |
for j, k := range rand.Perm(tasks) { | |
switch k { | |
case 0, 1: | |
populate() | |
// case 1: | |
// depopulate() | |
default: | |
query(false) | |
} | |
log.Printf("task %d,%d (%d) complete", i, j, k) | |
} | |
}(i) | |
} | |
wg.Wait() | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment