@@ -49,7 +49,7 @@ func TestAddMarshalUnmarshalHas(x *testing.T) {
49
49
t .assert_nil (set .Add (item ))
50
50
}
51
51
for i , item := range items {
52
- t .assert (fmt .Sprintf ("!set.Has(item) " , i ), set .Has (item ))
52
+ t .assert (fmt .Sprintf ("!set.Has(%v) " , i ), set .Has (item ))
53
53
}
54
54
marshal , unmarshal := types .IntMarshals ()
55
55
mset1 := NewMSortedSet (set , marshal , unmarshal )
@@ -59,7 +59,7 @@ func TestAddMarshalUnmarshalHas(x *testing.T) {
59
59
t .assert_nil (mset2 .UnmarshalBinary (bytes ))
60
60
set2 := mset2 .SortedSet ()
61
61
for i , item := range items {
62
- t .assert (fmt .Sprintf ("!set.Has(item )" , i ), set2 .Has (item ))
62
+ t .assert (fmt .Sprintf ("!set.Has(%v )" , i ), set2 .Has (item ))
63
63
}
64
64
}
65
65
@@ -82,7 +82,7 @@ func TestAddHasDeleteRandom(x *testing.T) {
82
82
for i := 0 ; i < 10 ; i ++ {
83
83
item , err := set .Random ()
84
84
t .assert_nil (err )
85
- t .assert (fmt .Sprintf ("!set.Has(item )" , i ), set .Has (item ))
85
+ t .assert (fmt .Sprintf ("!set.Has(%v )" , i ), set .Has (item ))
86
86
}
87
87
for _ , item := range items {
88
88
t .assert_nil (set .Delete (item ))
0 commit comments