Skip to content
Snippets Groups Projects
Commit 590b4a5e authored by aliiohs's avatar aliiohs
Browse files

fix

parent bc269043
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
gostd/container/hashset_test.go
+ 42
− 42
View file @ 590b4a5e
......@@ -21,70 +21,70 @@ import "testing"
func TestSetNew(t *testing.T) {
set := NewSet(2, 1)
if actualValue := Size(); actualValue != 2 {
if actualValue := set.Size(); actualValue != 2 {
t.Errorf("Got %v expected %v", actualValue, 2)
}
if actualValue := Contains(1); actualValue != true {
if actualValue := set.Contains(1); actualValue != true {
t.Errorf("Got %v expected %v", actualValue, true)
}
if actualValue := Contains(2); actualValue != true {
if actualValue := set.Contains(2); actualValue != true {
t.Errorf("Got %v expected %v", actualValue, true)
}
if actualValue := Contains(3); actualValue != false {
if actualValue := set.Contains(3); actualValue != false {
t.Errorf("Got %v expected %v", actualValue, true)
}
}
func TestSetAdd(t *testing.T) {
set := NewSet()
Add()
Add(1)
Add(2)
Add(2, 3)
Add()
if actualValue := Empty(); actualValue != false {
set.Add()
set.Add(1)
set.Add(2)
set.Add(2, 3)
set.Add()
if actualValue := set.Empty(); actualValue != false {
t.Errorf("Got %v expected %v", actualValue, false)
}
if actualValue := Size(); actualValue != 3 {
if actualValue := set.Size(); actualValue != 3 {
t.Errorf("Got %v expected %v", actualValue, 3)
}
}
func TestSetContains(t *testing.T) {
set := NewSet()
Add(3, 1, 2)
Add(2, 3)
Add()
if actualValue := Contains(); actualValue != true {
set.Add(3, 1, 2)
set.Add(2, 3)
set.Add()
if actualValue := set.Contains(); actualValue != true {
t.Errorf("Got %v expected %v", actualValue, true)
}
if actualValue := Contains(1); actualValue != true {
if actualValue := set.Contains(1); actualValue != true {
t.Errorf("Got %v expected %v", actualValue, true)
}
if actualValue := Contains(1, 2, 3); actualValue != true {
if actualValue := set.Contains(1, 2, 3); actualValue != true {
t.Errorf("Got %v expected %v", actualValue, true)
}
if actualValue := Contains(1, 2, 3, 4); actualValue != false {
if actualValue := set.Contains(1, 2, 3, 4); actualValue != false {
t.Errorf("Got %v expected %v", actualValue, false)
}
}
func TestSetRemove(t *testing.T) {
set := NewSet()
Add(3, 1, 2)
Remove()
if actualValue := Size(); actualValue != 3 {
set.Add(3, 1, 2)
set.Remove()
if actualValue := set.Size(); actualValue != 3 {
t.Errorf("Got %v expected %v", actualValue, 3)
}
Remove(1)
if actualValue := Size(); actualValue != 2 {
set.Remove(1)
if actualValue := set.Size(); actualValue != 2 {
t.Errorf("Got %v expected %v", actualValue, 2)
}
Remove(3)
Remove(3)
Remove()
Remove(2)
if actualValue := Size(); actualValue != 0 {
set.Remove(3)
set.Remove(3)
set.Remove()
set.Remove(2)
if actualValue := set.Size(); actualValue != 0 {
t.Errorf("Got %v expected %v", actualValue, 0)
}
}
......@@ -92,7 +92,7 @@ func TestSetRemove(t *testing.T) {
func benchmarkContains(b *testing.B, set *HashSet, size int) {
for i := 0; i < b.N; i++ {
for n := 0; n < size; n++ {
Contains(n)
set.Contains(n)
}
}
}
......@@ -100,7 +100,7 @@ func benchmarkContains(b *testing.B, set *HashSet, size int) {
func benchmarkAdd(b *testing.B, set *HashSet, size int) {
for i := 0; i < b.N; i++ {
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
}
}
......@@ -108,7 +108,7 @@ func benchmarkAdd(b *testing.B, set *HashSet, size int) {
func benchmarkRemove(b *testing.B, set *HashSet, size int) {
for i := 0; i < b.N; i++ {
for n := 0; n < size; n++ {
Remove(n)
set.Remove(n)
}
}
}
......@@ -118,7 +118,7 @@ func BenchmarkHashSetContains100(b *testing.B) {
size := 100
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkContains(b, set, size)
......@@ -129,7 +129,7 @@ func BenchmarkHashSetContains1000(b *testing.B) {
size := 1000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkContains(b, set, size)
......@@ -140,7 +140,7 @@ func BenchmarkHashSetContains10000(b *testing.B) {
size := 10000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkContains(b, set, size)
......@@ -151,7 +151,7 @@ func BenchmarkHashSetContains100000(b *testing.B) {
size := 100000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkContains(b, set, size)
......@@ -170,7 +170,7 @@ func BenchmarkHashSetAdd1000(b *testing.B) {
size := 1000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkAdd(b, set, size)
......@@ -181,7 +181,7 @@ func BenchmarkHashSetAdd10000(b *testing.B) {
size := 10000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkAdd(b, set, size)
......@@ -192,7 +192,7 @@ func BenchmarkHashSetAdd100000(b *testing.B) {
size := 100000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkAdd(b, set, size)
......@@ -203,7 +203,7 @@ func BenchmarkHashSetRemove100(b *testing.B) {
size := 100
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkRemove(b, set, size)
......@@ -214,7 +214,7 @@ func BenchmarkHashSetRemove1000(b *testing.B) {
size := 1000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkRemove(b, set, size)
......@@ -225,7 +225,7 @@ func BenchmarkHashSetRemove10000(b *testing.B) {
size := 10000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkRemove(b, set, size)
......@@ -236,7 +236,7 @@ func BenchmarkHashSetRemove100000(b *testing.B) {
size := 100000
set := NewSet()
for n := 0; n < size; n++ {
Add(n)
set.Add(n)
}
b.StartTimer()
benchmarkRemove(b, set, size)
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment