bloeys/nset
1
0
Fork 0
mirror of https://github.com/bloeys/nset.git synced 2025-12-29 14:28:20 +00:00
Code Issues Packages Projects Releases Wiki Activity

Docs and bench

Browse Source
This commit is contained in:
bloeys
2022-06-11 07:59:03 +04:00
parent 5a6e13b9f1
commit c55e5b0f01
5 changed files with 105 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

98
nset_test.go
View File

@ -447,6 +447,8 @@ func BenchmarkMapIsEq(b *testing.B) {
}
}
var getIntersectionNset *nset.NSet[uint32]
func BenchmarkNSetGetIntersection(b *testing.B) {
b.StopTimer()
@ -459,7 +461,93 @@ func BenchmarkNSetGetIntersection(b *testing.B) {
b.StartTimer()
for i := 0; i < b.N; i++ {
s1.GetIntersection(s2)
getIntersectionNset = s1.GetIntersection(s2)
}
}
var getIntersectionTempMap map[uint32]struct{}
func BenchmarkMapGetIntersection(b *testing.B) {
b.StopTimer()
m1 := map[uint32]struct{}{}
m2 := map[uint32]struct{}{}
for i := uint32(0); i < maxBenchSize; i++ {
m1[i] = struct{}{}
m2[i] = struct{}{}
}
b.StartTimer()
getIntersection := func(m1, m2 map[uint32]struct{}) map[uint32]struct{} {
outMap := map[uint32]struct{}{}
for k := range m1 {
if _, ok := m2[k]; ok {
outMap[k] = struct{}{}
}
}
return outMap
}
for i := 0; i < b.N; i++ {
getIntersectionTempMap = getIntersection(m1, m2)
}
}
func BenchmarkNSetGetIntersectionRand(b *testing.B) {
b.StopTimer()
rand.Seed(RandSeed)
s1 := nset.NewNSet[uint32]()
s2 := nset.NewNSet[uint32]()
for i := uint32(0); i < maxBenchSize; i++ {
r := rand.Uint32()
s1.Add(r)
s2.Add(r)
}
b.StartTimer()
for i := 0; i < b.N; i++ {
getIntersectionNset = s1.GetIntersection(s2)
}
}
func BenchmarkMapGetIntersectionRand(b *testing.B) {
b.StopTimer()
rand.Seed(RandSeed)
m1 := map[uint32]struct{}{}
m2 := map[uint32]struct{}{}
for i := uint32(0); i < maxBenchSize; i++ {
r := rand.Uint32()
m1[r] = struct{}{}
m2[r] = struct{}{}
}
b.StartTimer()
getIntersection := func(m1, m2 map[uint32]struct{}) map[uint32]struct{} {
outMap := map[uint32]struct{}{}
for k := range m1 {
if _, ok := m2[k]; ok {
outMap[k] = struct{}{}
}
}
return outMap
}
for i := 0; i < b.N; i++ {
getIntersectionTempMap = getIntersection(m1, m2)
}
}
@ -470,7 +558,7 @@ func BenchmarkNSetGetAllElements(b *testing.B) {
b.StopTimer()
s1 := nset.NewNSet[uint32]()
for i := uint32(0); i < 1000_000; i++ {
for i := uint32(0); i < 10_000_000; i++ {
s1.Add(i)
}
b.StartTimer()
@ -488,7 +576,7 @@ func BenchmarkMapGetAllElements(b *testing.B) {
b.StopTimer()
m1 := map[uint32]struct{}{}
for i := uint32(0); i < 1000_000; i++ {
for i := uint32(0); i < 10_000_000; i++ {
m1[i] = struct{}{}
}
b.StartTimer()
@ -517,7 +605,7 @@ func BenchmarkNSetGetAllElementsRand(b *testing.B) {
rand.Seed(RandSeed)
s1 := nset.NewNSet[uint32]()
for i := uint32(0); i < 1000_000; i++ {
for i := uint32(0); i < 10_000_000; i++ {
s1.Add(rand.Uint32())
}
b.StartTimer()
@ -537,7 +625,7 @@ func BenchmarkMapGetAllElementsRand(b *testing.B) {
rand.Seed(RandSeed)
m1 := map[uint32]struct{}{}
for i := uint32(0); i < 1000_000; i++ {
for i := uint32(0); i < 10_000_000; i++ {
m1[rand.Uint32()] = struct{}{}
}