@@ -49,7 +49,7 @@ func TestAddMarshalUnmarshalHas(x *testing.T) {
4949 t .assert_nil (set .Add (item ))
5050 }
5151 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 ))
5353 }
5454 marshal , unmarshal := types .IntMarshals ()
5555 mset1 := NewMSortedSet (set , marshal , unmarshal )
@@ -59,7 +59,7 @@ func TestAddMarshalUnmarshalHas(x *testing.T) {
5959 t .assert_nil (mset2 .UnmarshalBinary (bytes ))
6060 set2 := mset2 .SortedSet ()
6161 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 ))
6363 }
6464}
6565
@@ -82,7 +82,7 @@ func TestAddHasDeleteRandom(x *testing.T) {
8282 for i := 0 ; i < 10 ; i ++ {
8383 item , err := set .Random ()
8484 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 ))
8686 }
8787 for _ , item := range items {
8888 t .assert_nil (set .Delete (item ))
0 commit comments