Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 9 additions & 6 deletions bench_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -38,20 +38,23 @@ func nrand(n int) []int {
return i
}

func benchAdd(b *testing.B, s Set[int]) {
nums := nrand(b.N)
func benchAdd(b *testing.B, n int, newSet func(...int) Set[int]) {
nums := nrand(n)
b.ResetTimer()
for _, v := range nums {
s.Add(v)
for i := 0; i < b.N; i++ {
s := newSet()
for _, v := range nums {
s.Add(v)
}
}
}

func BenchmarkAddSafe(b *testing.B) {
benchAdd(b, NewSet[int]())
benchAdd(b, 1000, NewSet[int])
}

func BenchmarkAddUnsafe(b *testing.B) {
benchAdd(b, NewThreadUnsafeSet[int]())
benchAdd(b, 1000, NewThreadUnsafeSet[int])
}

func benchRemove(b *testing.B, s Set[int]) {
Expand Down
8 changes: 2 additions & 6 deletions threadunsafe.go
Original file line number Diff line number Diff line change
Expand Up @@ -42,13 +42,9 @@ func newThreadUnsafeSet[T comparable]() threadUnsafeSet[T] {
}

func (s *threadUnsafeSet[T]) Add(v T) bool {
_, found := (*s)[v]
if found {
return false //False if it existed already
}

prevLen := len(*s)
(*s)[v] = struct{}{}
return true
return prevLen != len(*s)
}

func (s *threadUnsafeSet[T]) Cardinality() int {
Expand Down