diff --git a/examples/gno.land/p/demo/btree/btree_test.gno b/examples/gno.land/p/demo/btree/btree_test.gno index a0f7c1c55ca..871e8c25e1d 100644 --- a/examples/gno.land/p/demo/btree/btree_test.gno +++ b/examples/gno.land/p/demo/btree/btree_test.gno @@ -138,7 +138,7 @@ func TestHas(t *testing.T) { } func TestMin(t *testing.T) { - min := Content(genericSeeding(New(WithDegree(10)), 53).Min()) + min := genericSeeding(New(WithDegree(10)), 53).Min().(Content) if min.Key != 0 { t.Errorf("Minimum should have been 0, but it was reported as %d.", min) @@ -146,24 +146,24 @@ func TestMin(t *testing.T) { } func TestMax(t *testing.T) { - max := Content(genericSeeding(New(WithDegree(10)), 53).Min()) + max := genericSeeding(New(WithDegree(10)), 53).Max().(Content) - if max.Key != 0 { - t.Errorf("Minimum should have been 0, but it was reported as %d.", max) + if max.Key != 52 { + t.Errorf("Maximum should have been 52, but it was reported as %d.", max) } } func TestGet(t *testing.T) { tree := genericSeeding(New(WithDegree(10)), 40) - if Content(tree.Get(Content{Key: 7})).Value != "Value_7" { - t.Errorf("Get(7) should have returned 'Value_7', but it returned %v.", tree.Get(Content{Key: 7})) + if val := tree.Get(Content{Key: 7}); val != nil && val.(Content).Value != "Value_7" { + t.Errorf("Get(7) should have returned 'Value_7', but it returned %v.", val) } - if Content(tree.Get(Content{Key: 39})).Value != "Value_39" { - t.Errorf("Get(40) should have returnd 'Value_39', but it returned %v.", tree.Get(Content{Key: 39})) + if val := tree.Get(Content{Key: 39}); val != nil && val.(Content).Value != "Value_39" { + t.Errorf("Get(39) should have returned 'Value_39', but it returned %v.", val) } - if tree.Get(Content{Key: 1111}) != nil { - t.Errorf("Get(1111) returned %v, but it should be nil.", Content(tree.Get(Content{Key: 1111}))) + if val := tree.Get(Content{Key: 1111}); val != nil { + t.Errorf("Get(1111) returned %v, but it should be nil.", val) } } @@ -174,8 +174,8 @@ func TestDescend(t *testing.T) { found := []int{} tree.Descend(func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) @@ -191,8 +191,8 @@ func TestDescendGreaterThan(t *testing.T) { found := []int{} tree.DescendGreaterThan(Content{Key: 4}, func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) @@ -208,8 +208,8 @@ func TestDescendLessOrEqual(t *testing.T) { found := []int{} tree.DescendLessOrEqual(Content{Key: 4}, func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) @@ -225,8 +225,8 @@ func TestDescendRange(t *testing.T) { found := []int{} tree.DescendRange(Content{Key: 6}, Content{Key: 1}, func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) @@ -242,8 +242,8 @@ func TestAscend(t *testing.T) { found := []int{} tree.Ascend(func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) @@ -259,8 +259,8 @@ func TestAscendGreaterOrEqual(t *testing.T) { found := []int{} tree.AscendGreaterOrEqual(Content{Key: 5}, func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) @@ -276,13 +276,13 @@ func TestAscendLessThan(t *testing.T) { found := []int{} tree.AscendLessThan(Content{Key: 5}, func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) if intSlicesCompare(expected, found) != 0 { - t.Errorf("DescendLessOrEqual returned the wrong sequence. Expected %v, but got %v.", expected, found) + t.Errorf("AscendLessThan returned the wrong sequence. Expected %v, but got %v.", expected, found) } } @@ -293,13 +293,13 @@ func TestAscendRange(t *testing.T) { found := []int{} tree.AscendRange(Content{Key: 2}, Content{Key: 7}, func(_record Record) bool { - record := Content(_record) - found = append(found, int(record.Key)) + record := _record.(Content) + found = append(found, record.Key.(int)) return true }) if intSlicesCompare(expected, found) != 0 { - t.Errorf("DescendRange returned the wrong sequence. Expected %v, but got %v.", expected, found) + t.Errorf("AscendRange returned the wrong sequence. Expected %v, but got %v.", expected, found) } } @@ -309,11 +309,11 @@ func TestDeleteMin(t *testing.T) { expected := []int{0, 1, 2, 3, 4} found := []int{} - found = append(found, int(Content(tree.DeleteMin()).Key)) - found = append(found, int(Content(tree.DeleteMin()).Key)) - found = append(found, int(Content(tree.DeleteMin()).Key)) - found = append(found, int(Content(tree.DeleteMin()).Key)) - found = append(found, int(Content(tree.DeleteMin()).Key)) + found = append(found, tree.DeleteMin().(Content).Key.(int)) + found = append(found, tree.DeleteMin().(Content).Key.(int)) + found = append(found, tree.DeleteMin().(Content).Key.(int)) + found = append(found, tree.DeleteMin().(Content).Key.(int)) + found = append(found, tree.DeleteMin().(Content).Key.(int)) if intSlicesCompare(expected, found) != 0 { t.Errorf("5 rounds of DeleteMin returned the wrong elements. Expected %v, but got %v.", expected, found) @@ -326,11 +326,11 @@ func TestShift(t *testing.T) { expected := []int{0, 1, 2, 3, 4} found := []int{} - found = append(found, int(Content(tree.Shift()).Key)) - found = append(found, int(Content(tree.Shift()).Key)) - found = append(found, int(Content(tree.Shift()).Key)) - found = append(found, int(Content(tree.Shift()).Key)) - found = append(found, int(Content(tree.Shift()).Key)) + found = append(found, tree.Shift().(Content).Key.(int)) + found = append(found, tree.Shift().(Content).Key.(int)) + found = append(found, tree.Shift().(Content).Key.(int)) + found = append(found, tree.Shift().(Content).Key.(int)) + found = append(found, tree.Shift().(Content).Key.(int)) if intSlicesCompare(expected, found) != 0 { t.Errorf("5 rounds of Shift returned the wrong elements. Expected %v, but got %v.", expected, found) @@ -343,14 +343,14 @@ func TestDeleteMax(t *testing.T) { expected := []int{99, 98, 97, 96, 95} found := []int{} - found = append(found, int(Content(tree.DeleteMax()).Key)) - found = append(found, int(Content(tree.DeleteMax()).Key)) - found = append(found, int(Content(tree.DeleteMax()).Key)) - found = append(found, int(Content(tree.DeleteMax()).Key)) - found = append(found, int(Content(tree.DeleteMax()).Key)) + found = append(found, tree.DeleteMax().(Content).Key.(int)) + found = append(found, tree.DeleteMax().(Content).Key.(int)) + found = append(found, tree.DeleteMax().(Content).Key.(int)) + found = append(found, tree.DeleteMax().(Content).Key.(int)) + found = append(found, tree.DeleteMax().(Content).Key.(int)) if intSlicesCompare(expected, found) != 0 { - t.Errorf("5 rounds of DeleteMin returned the wrong elements. Expected %v, but got %v.", expected, found) + t.Errorf("5 rounds of DeleteMax returned the wrong elements. Expected %v, but got %v.", expected, found) } } @@ -360,14 +360,14 @@ func TestPop(t *testing.T) { expected := []int{99, 98, 97, 96, 95} found := []int{} - found = append(found, int(Content(tree.Pop()).Key)) - found = append(found, int(Content(tree.Pop()).Key)) - found = append(found, int(Content(tree.Pop()).Key)) - found = append(found, int(Content(tree.Pop()).Key)) - found = append(found, int(Content(tree.Pop()).Key)) + found = append(found, tree.Pop().(Content).Key.(int)) + found = append(found, tree.Pop().(Content).Key.(int)) + found = append(found, tree.Pop().(Content).Key.(int)) + found = append(found, tree.Pop().(Content).Key.(int)) + found = append(found, tree.Pop().(Content).Key.(int)) if intSlicesCompare(expected, found) != 0 { - t.Errorf("5 rounds of DeleteMin returned the wrong elements. Expected %v, but got %v.", expected, found) + t.Errorf("5 rounds of Pop returned the wrong elements. Expected %v, but got %v.", expected, found) } } @@ -383,13 +383,15 @@ func TestInsertGet(t *testing.T) { } for count := 0; count < 20; count++ { - if tree.Get(Content{Key: count}) != expected[count] { - t.Errorf("Insert/Get doesn't appear to be working. Expected to retrieve %v with key %d, but got %v.", expected[count], count, tree.Get(Content{Key: count})) + val := tree.Get(Content{Key: count}) + if val == nil || val.(Content) != expected[count] { + t.Errorf("Insert/Get doesn't appear to be working. Expected to retrieve %v with key %d, but got %v.", expected[count], count, val) } } } func TestClone(t *testing.T) { + // Implement the clone test } // ***** The following tests are functional or stress testing type tests. @@ -440,18 +442,18 @@ func TestBTree(t *testing.T) { val := tree.Get(test.test) if test.expected { - if val != nil && Content(val).Value == test.test.Value { + if val != nil && val.(Content).Value == test.test.Value { t.Logf("Found expected key:value %v:%v", test.test.Key, test.test.Value) } else { if val == nil { t.Logf("Didn't find %v, but expected", test.test.Key) } else { - t.Errorf("Expected key %v:%v, but found %v:%v.", test.test.Key, test.test.Value, Content(val).Key, Content(val).Value) + t.Errorf("Expected key %v:%v, but found %v:%v.", test.test.Key, test.test.Value, val.(Content).Key, val.(Content).Value) } } } else { if val != nil { - t.Errorf("Did not expect key %v, but found key:value %v:%v", test.test.Key, Content(val).Key, Content(val).Value) + t.Errorf("Did not expect key %v, but found key:value %v:%v", test.test.Key, val.(Content).Key, val.(Content).Value) } else { t.Logf("Didn't find %v, but wasn't expected", test.test.Key) } @@ -474,7 +476,7 @@ func TestBTree(t *testing.T) { t.Logf("Tree Length: %d", tree.Len()) tree.Ascend(func(_record Record) bool { - record := Content(_record) + record := _record.(Content) t.Logf("Key:Value == %v:%v", record.Key, record.Value) if record.Key != sortedInsertData[pos].Key { t.Errorf("Out of order! Expected %v, but got %v", sortedInsertData[pos].Key, record.Key) @@ -487,7 +489,7 @@ func TestBTree(t *testing.T) { pos = len(sortedInsertData) - 1 tree.Descend(func(_record Record) bool { - record := Content(_record) + record := _record.(Content) t.Logf("Key:Value == %v:%v", record.Key, record.Value) if record.Key != sortedInsertData[pos].Key { t.Errorf("Out of order! Expected %v, but got %v", sortedInsertData[pos].Key, record.Key) @@ -497,10 +499,10 @@ func TestBTree(t *testing.T) { }) deleteTests := []Content{ - Content{Key: 10, Value: "Value_10"}, - Content{Key: 15, Value: ""}, - Content{Key: "banana", Value: "Fruit_banana"}, - Content{Key: "kiwi", Value: ""}, + {Key: 10, Value: "Value_10"}, + {Key: 15, Value: ""}, + {Key: "banana", Value: "Fruit_banana"}, + {Key: "kiwi", Value: ""}, } for _, test := range deleteTests { fmt.Printf("\nDeleting %+v\n", test) @@ -514,7 +516,7 @@ func TestBTree(t *testing.T) { for _, test := range deleteTests { val := tree.Get(test) if val != nil { - t.Errorf("Did not expect key %v, but found key:value %v:%v", test.Key, Content(val).Key, Content(val).Value) + t.Errorf("Did not expect key %v, but found key:value %v:%v", test.Key, val.(Content).Key, val.(Content).Value) } else { t.Logf("Didn't find %v, but wasn't expected", test.Key) } @@ -558,7 +560,7 @@ func TestStress(t *testing.T) { val := tree.Get(content) if i%2 == 0 { if val != nil { - t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, Content(val).Key, Content(val).Value) + t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, val.(Content).Key, val.(Content).Value) } } else { if val == nil { @@ -643,7 +645,7 @@ func TestBTreeCloneIsolation(t *testing.T) { if i%3 == 0 || i%2 == 0 { if val != nil { - t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, Content(val).Key, Content(val).Value) + t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, val.(Content).Key, val.(Content).Value) } } else { if val == nil { @@ -654,7 +656,7 @@ func TestBTreeCloneIsolation(t *testing.T) { val = clone.Get(content) if i%2 != 0 || i%3 == 0 { if val != nil { - t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, Content(val).Key, Content(val).Value) + t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, val.(Content).Key, val.(Content).Value) } } else { if val == nil { @@ -665,7 +667,7 @@ func TestBTreeCloneIsolation(t *testing.T) { val = clone2.Get(content) if i%2 != 0 || (i-2)%3 == 0 { if val != nil { - t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, Content(val).Key, Content(val).Value) + t.Errorf("Didn't expect key %v, but found key:value %v:%v", content.Key, val.(Content).Key, val.(Content).Value) } } else { if val == nil { diff --git a/examples/gno.land/p/demo/context/context_test.gno b/examples/gno.land/p/demo/context/context_test.gno index 0059f0d2a25..d8e2069363d 100644 --- a/examples/gno.land/p/demo/context/context_test.gno +++ b/examples/gno.land/p/demo/context/context_test.gno @@ -9,7 +9,7 @@ func TestContextExample(t *testing.T) { ctx := WithValue(Empty(), k, "Gno") if v := ctx.Value(k); v != nil { - if string(v) != "Gno" { + if v.(string) != "Gno" { t.Errorf("language value should be Gno, but is %s", v) } } else { diff --git a/examples/gno.land/p/demo/grc/grc1155/basic_grc1155_token_test.gno b/examples/gno.land/p/demo/grc/grc1155/basic_grc1155_token_test.gno index 2fef3431b43..930ae03fa04 100644 --- a/examples/gno.land/p/demo/grc/grc1155/basic_grc1155_token_test.gno +++ b/examples/gno.land/p/demo/grc/grc1155/basic_grc1155_token_test.gno @@ -30,7 +30,7 @@ func TestBalanceOf(t *testing.T) { tid1 := TokenID("1") tid2 := TokenID("2") - balanceZeroAddressOfToken1, err := dummy.BalanceOf(zeroAddress, tid1) + _, err := dummy.BalanceOf(zeroAddress, tid1) uassert.Error(t, err, "should result in error") balanceAddr1OfToken1, err := dummy.BalanceOf(addr1, tid1) diff --git a/examples/gno.land/p/demo/grc/grc721/basic_nft_test.gno b/examples/gno.land/p/demo/grc/grc721/basic_nft_test.gno index 6375b0307a8..0481bf6b268 100644 --- a/examples/gno.land/p/demo/grc/grc721/basic_nft_test.gno +++ b/examples/gno.land/p/demo/grc/grc721/basic_nft_test.gno @@ -128,7 +128,7 @@ func TestGetApproved(t *testing.T) { dummy := NewBasicNFT(dummyNFTName, dummyNFTSymbol) uassert.True(t, dummy != nil, "should not be nil") - approvedAddr, err := dummy.GetApproved(TokenID("invalid")) + _, err := dummy.GetApproved(TokenID("invalid")) uassert.Error(t, err, "should result in error") } @@ -247,7 +247,7 @@ func TestBurn(t *testing.T) { uassert.NoError(t, err, "should not result in error") // Check Owner of Token id - owner, err := dummy.OwnerOf(TokenID("1")) + _, err = dummy.OwnerOf(TokenID("1")) uassert.Error(t, err, "should result in error") } diff --git a/examples/gno.land/p/demo/grc/grc721/grc721_royalty_test.gno b/examples/gno.land/p/demo/grc/grc721/grc721_royalty_test.gno index 7893453a1c6..af5b4d3b239 100644 --- a/examples/gno.land/p/demo/grc/grc721/grc721_royalty_test.gno +++ b/examples/gno.land/p/demo/grc/grc721/grc721_royalty_test.gno @@ -32,7 +32,7 @@ func TestSetTokenRoyalty(t *testing.T) { uassert.NoError(t, derr, "Should not result in error") // Test case: Invalid token ID - err := dummy.SetTokenRoyalty(TokenID("3"), RoyaltyInfo{ + _ = dummy.SetTokenRoyalty(TokenID("3"), RoyaltyInfo{ PaymentAddress: paymentAddress, Percentage: percentage, }) diff --git a/examples/gno.land/p/demo/grc/grc777/dummy_test.gno b/examples/gno.land/p/demo/grc/grc777/dummy_test.gno index 5f8ac3598d1..33415fc689a 100644 --- a/examples/gno.land/p/demo/grc/grc777/dummy_test.gno +++ b/examples/gno.land/p/demo/grc/grc777/dummy_test.gno @@ -11,7 +11,7 @@ type dummyImpl struct{} var _ IGRC777 = (*dummyImpl)(nil) func TestInterface(t *testing.T) { - var dummy IGRC777 = &dummyImpl{} + var _ IGRC777 = &dummyImpl{} } func (impl *dummyImpl) GetName() string { panic("not implemented") } diff --git a/examples/gno.land/p/demo/subscription/recurring/recurring_test.gno b/examples/gno.land/p/demo/subscription/recurring/recurring_test.gno index e8bca15c0bf..0b458b716ec 100644 --- a/examples/gno.land/p/demo/subscription/recurring/recurring_test.gno +++ b/examples/gno.land/p/demo/subscription/recurring/recurring_test.gno @@ -26,7 +26,7 @@ func TestRecurringSubscription(t *testing.T) { err = rs.HasValidSubscription(std.PrevRealm().Addr()) uassert.NoError(t, err, "Expected Alice to have access") - expiration, err := rs.GetExpiration(std.PrevRealm().Addr()) + _, err = rs.GetExpiration(std.PrevRealm().Addr()) uassert.NoError(t, err, "Expected to get expiration for Alice") } diff --git a/examples/gno.land/p/moul/typeutil/typeutil_test.gno b/examples/gno.land/p/moul/typeutil/typeutil_test.gno index 543ea1deec4..2aaf1b0e93d 100644 --- a/examples/gno.land/p/moul/typeutil/typeutil_test.gno +++ b/examples/gno.land/p/moul/typeutil/typeutil_test.gno @@ -278,10 +278,6 @@ func TestIsZero(t *testing.T) { } func TestToInterfaceSlice(t *testing.T) { - now := time.Now() - addr := std.Address("g1jg8mtutu9khhfwc4nxmuhcpftf0pajdhfvsqf5") - str := testStringer{value: "hello"} - tests := []struct { name string input interface{} diff --git a/examples/gno.land/p/n2p5/loci/loci_test.gno b/examples/gno.land/p/n2p5/loci/loci_test.gno index bb216a8539e..6df6d4f9b2d 100644 --- a/examples/gno.land/p/n2p5/loci/loci_test.gno +++ b/examples/gno.land/p/n2p5/loci/loci_test.gno @@ -8,11 +8,6 @@ import ( ) func TestLociStore(t *testing.T) { - t.Parallel() - - u1 := testutils.TestAddress("u1") - u2 := testutils.TestAddress("u1") - t.Run("TestSet", func(t *testing.T) { t.Parallel() store := New() diff --git a/examples/gno.land/p/wyhaines/rand/isaac/isaac_test.gno b/examples/gno.land/p/wyhaines/rand/isaac/isaac_test.gno index b08621e271c..fdf633bb543 100644 --- a/examples/gno.land/p/wyhaines/rand/isaac/isaac_test.gno +++ b/examples/gno.land/p/wyhaines/rand/isaac/isaac_test.gno @@ -14,7 +14,7 @@ type OpenISAAC struct { } func TestISAACSeeding(t *testing.T) { - isaac := New() + _ = New() } func TestISAACRand(t *testing.T) { diff --git a/examples/gno.land/p/wyhaines/rand/isaac64/isaac64_test.gno b/examples/gno.land/p/wyhaines/rand/isaac64/isaac64_test.gno index 239e7f818fb..74abf2c13ca 100644 --- a/examples/gno.land/p/wyhaines/rand/isaac64/isaac64_test.gno +++ b/examples/gno.land/p/wyhaines/rand/isaac64/isaac64_test.gno @@ -14,7 +14,7 @@ type OpenISAAC struct { } func TestISAACSeeding(t *testing.T) { - isaac := New() + _ = New() } func TestISAACRand(t *testing.T) { diff --git a/examples/gno.land/r/demo/foo1155/foo1155_test.gno b/examples/gno.land/r/demo/foo1155/foo1155_test.gno index 64d4bc1256f..8ea722939f2 100644 --- a/examples/gno.land/r/demo/foo1155/foo1155_test.gno +++ b/examples/gno.land/r/demo/foo1155/foo1155_test.gno @@ -11,9 +11,8 @@ func TestFoo721(t *testing.T) { admin := users.AddressOrName("g10x5phu0k6p64cwrhfpsc8tk43st9kug6wft530") bob := users.AddressOrName("g1ze6et22ces5atv79y4xh38s4kuraey4y2fr6tw") tid1 := grc1155.TokenID("1") - tid2 := grc1155.TokenID("2") - for i, tc := range []struct { + for _, tc := range []struct { name string expected interface{} fn func() interface{} diff --git a/examples/gno.land/r/demo/foo20/foo20_test.gno b/examples/gno.land/r/demo/foo20/foo20_test.gno index b9e80fbb476..dbafe2d6c1d 100644 --- a/examples/gno.land/r/demo/foo20/foo20_test.gno +++ b/examples/gno.land/r/demo/foo20/foo20_test.gno @@ -61,7 +61,6 @@ func TestReadOnlyPublicMethods(t *testing.T) { func TestErrConditions(t *testing.T) { var ( admin = pusers.AddressOrName("g1manfred47kzduec920z88wfr64ylksmdcedlf5") - alice = pusers.AddressOrName(testutils.TestAddress("alice")) empty = pusers.AddressOrName("") ) diff --git a/examples/gno.land/r/demo/foo721/foo721_test.gno b/examples/gno.land/r/demo/foo721/foo721_test.gno index 2477ca34fde..fab39e561d1 100644 --- a/examples/gno.land/r/demo/foo721/foo721_test.gno +++ b/examples/gno.land/r/demo/foo721/foo721_test.gno @@ -13,7 +13,7 @@ func TestFoo721(t *testing.T) { admin := pusers.AddressOrName("g1us8428u2a5satrlxzagqqa5m6vmuze025anjlj") hariom := pusers.AddressOrName("g1var589z07ppjsjd24ukm4uguzwdt0tw7g47cgm") - for i, tc := range []struct { + for _, tc := range []struct { name string expected interface{} fn func() interface{} diff --git a/examples/gno.land/r/demo/games/dice_roller/dice_roller_test.gno b/examples/gno.land/r/demo/games/dice_roller/dice_roller_test.gno index 2f6770a366f..4697b03bf66 100644 --- a/examples/gno.land/r/demo/games/dice_roller/dice_roller_test.gno +++ b/examples/gno.land/r/demo/games/dice_roller/dice_roller_test.gno @@ -128,7 +128,7 @@ func TestPlayBeyondGameEnd(t *testing.T) { Play(gameID) // Check if the game is over - g, err := getGame(gameID) + _, err := getGame(gameID) urequire.NoError(t, err) // Attempt to play more should fail diff --git a/examples/gno.land/r/demo/keystore/keystore_test.gno b/examples/gno.land/r/demo/keystore/keystore_test.gno index 9b5fafa2f95..03b61e79663 100644 --- a/examples/gno.land/r/demo/keystore/keystore_test.gno +++ b/examples/gno.land/r/demo/keystore/keystore_test.gno @@ -56,7 +56,7 @@ func TestRender(t *testing.T) { p := "" if len(tc.ps) > 0 { p = tc.owner.String() - for i, psv := range tc.ps { + for _, psv := range tc.ps { p += ":" + psv } } diff --git a/examples/gno.land/r/gnoland/blog/gnoblog_test.gno b/examples/gno.land/r/gnoland/blog/gnoblog_test.gno index b4658db4fb5..d046eb80f42 100644 --- a/examples/gno.land/r/gnoland/blog/gnoblog_test.gno +++ b/examples/gno.land/r/gnoland/blog/gnoblog_test.gno @@ -8,9 +8,6 @@ import ( func TestPackage(t *testing.T) { std.TestSetOrigCaller(std.Address("g1manfred47kzduec920z88wfr64ylksmdcedlf5")) - - author := std.GetOrigCaller() - // by default, no posts. { got := Render("") diff --git a/examples/gno.land/r/ursulovic/home/home.gno b/examples/gno.land/r/ursulovic/home/home.gno index c03d8a66868..cc420df5e6e 100644 --- a/examples/gno.land/r/ursulovic/home/home.gno +++ b/examples/gno.land/r/ursulovic/home/home.gno @@ -19,7 +19,6 @@ var ( githubUrl string linkedinUrl string - connectUrl string imageUpdatePrice int64 isValidUrl func(string) bool