feat(gnovm): add any type (#3862)

This exists in Go, and it's a pain to add it later as a global, so
making a PR to add this.

extracted from #3847.

---------

Co-authored-by: ltzmaxwell <[email protected]>

Author: 2 people

docs/assets/how-to-guides/porting-solidity-to-gno/porting-1.gno

@@ -1,4 +1,4 @@
-func shouldEqual(t *testing.T, got interface{}, expected interface{}) {
+func shouldEqual(t *testing.T, got any, expected any) {
 	t.Helper()
 
 	if got != expected {

docs/assets/how-to-guides/write-simple-dapp/poll-1.gno

@@ -59,7 +59,7 @@ func (p *Poll) HasVoted(address std.Address) (bool, bool) {
 func (p Poll) VoteCount() (int, int) {
 	var yay int
 
-	p.Voters().Iterate("", "", func(key string, value interface{}) bool {
+	p.Voters().Iterate("", "", func(key string, value any) bool {
 		vote := value.(bool)
 		if vote == true {
 			yay = yay + 1

docs/assets/how-to-guides/write-simple-dapp/poll-3.gno

@@ -7,7 +7,7 @@ func Render(path string) string {
 		b.WriteString("### No active polls currently!")
 		return b.String()
 	}
-	polls.Iterate("", "", func(key string, value interface{}) bool {
+	polls.Iterate("", "", func(key string, value any) bool {
 
 		// cast raw data from tree into Poll struct
 		p := value.(*poll.Poll)
@@ -50,7 +50,7 @@ func Render(path string) string {
 		dropdown = "<br><details>\n<summary>Vote details</summary>"
 		b.WriteString(dropdown)
 
-		p.Voters().Iterate("", "", func(key string, value interface{}) bool {
+		p.Voters().Iterate("", "", func(key string, value any) bool {
 
 			voter := key
 			vote := value.(bool)

docs/how-to-guides/porting-solidity-to-gno.md

@@ -180,7 +180,7 @@ Below is a test case helper that will help implement each condition.
 
 [embedmd]:# (../assets/how-to-guides/porting-solidity-to-gno/porting-1.gno go)
 ```go
-func shouldEqual(t *testing.T, got interface{}, expected interface{}) {
+func shouldEqual(t *testing.T, got any, expected any) {
 	t.Helper()
 
 	if got != expected {

docs/how-to-guides/write-simple-dapp.md

@@ -89,7 +89,7 @@ func (p *Poll) HasVoted(address std.Address) (bool, bool) {
 func (p Poll) VoteCount() (int, int) {
 	var yay int
 
-	p.Voters().Iterate("", "", func(key string, value interface{}) bool {
+	p.Voters().Iterate("", "", func(key string, value any) bool {
 		vote := value.(bool)
 		if vote == true {
 			yay = yay + 1
@@ -229,7 +229,7 @@ func Render(path string) string {
 		b.WriteString("### No active polls currently!")
 		return b.String()
 	}
-	polls.Iterate("", "", func(key string, value interface{}) bool {
+	polls.Iterate("", "", func(key string, value any) bool {
 
 		// cast raw data from tree into Poll struct
 		p := value.(*poll.Poll)
@@ -272,7 +272,7 @@ func Render(path string) string {
 		dropdown = "<br><details>\n<summary>Vote details</summary>"
 		b.WriteString(dropdown)
 
-		p.Voters().Iterate("", "", func(key string, value interface{}) bool {
+		p.Voters().Iterate("", "", func(key string, value any) bool {
 
 			voter := key
 			vote := value.(bool)

docs/reference/go-gno-compatibility.md

@@ -54,7 +54,7 @@ rune := rune('a')
 | `uintptr`, `unsafe.Pointer`                   | missing                | missing                                                    |
 | `string`                                      | full                   | full                                                       |
 | `rune`                                        | full                   | full                                                       |
-| `interface{}`                                 | full                   | full                                                       |
+| `interface{}` / `any`                         | full                   | full                                                       |
 | `[]T` (slices)                                | full                   | full\*                                                     |
 | `[N]T` (arrays)                               | full                   | full\*                                                     |
 | `map[T1]T2`                                   | full                   | full\*                                                     |

examples/gno.land/p/demo/avl/list/list.gno

@@ -19,7 +19,7 @@
 //	l.Delete(0)       // removes first element
 //
 //	// Iterate over elements
-//	l.ForEach(func(index int, value interface{}) bool {
+//	l.ForEach(func(index int, value any) bool {
 //	    ufmt.Printf("index %d: %v\n", index, value)
 //	    return false  // continue iteration
 //	})
@@ -44,12 +44,12 @@ import (
 // IList defines the interface for list operations
 type IList interface {
 	Len() int
-	Append(values ...interface{})
-	Get(index int) interface{}
-	Set(index int, value interface{}) bool
-	Delete(index int) (interface{}, bool)
-	Slice(startIndex, endIndex int) []interface{}
-	ForEach(fn func(index int, value interface{}) bool)
+	Append(values ...any)
+	Get(index int) any
+	Set(index int, value any) bool
+	Delete(index int) (any, bool)
+	Slice(startIndex, endIndex int) []any
+	ForEach(fn func(index int, value any) bool)
 	Clone() *List
 	DeleteRange(startIndex, endIndex int) int
 }
@@ -82,7 +82,7 @@ func (l *List) Len() int {
 //	l.Append(1)        // adds single value
 //	l.Append(2, 3, 4)  // adds multiple values
 //	println(l.Len()) // Output: 4
-func (l *List) Append(values ...interface{}) {
+func (l *List) Append(values ...any) {
 	for _, v := range values {
 		l.tree.Set(l.idGen.Next().String(), v)
 	}
@@ -98,7 +98,7 @@ func (l *List) Append(values ...interface{}) {
 //	println(l.Get(1))    // Output: 2
 //	println(l.Get(-1))   // Output: nil
 //	println(l.Get(999))  // Output: nil
-func (l *List) Get(index int) interface{} {
+func (l *List) Get(index int) any {
 	if index < 0 || index >= l.tree.Size() {
 		return nil
 	}
@@ -123,7 +123,7 @@ func (l *List) Get(index int) interface{} {
 //
 //	l.Set(-1, 5)      // invalid index
 //	println(l.Len()) // Output: 4 (list unchanged)
-func (l *List) Set(index int, value interface{}) bool {
+func (l *List) Set(index int, value any) bool {
 	size := l.tree.Size()
 
 	// Handle empty list case - only allow index 0
@@ -170,7 +170,7 @@ func (l *List) Set(index int, value interface{}) bool {
 //
 //	val, ok = l.Delete(-1)
 //	println(val, ok)  // Output: nil false
-func (l *List) Delete(index int) (interface{}, bool) {
+func (l *List) Delete(index int) (any, bool) {
 	size := l.tree.Size()
 	// Always return nil, false for empty list
 	if size == 0 {
@@ -202,7 +202,7 @@ func (l *List) Delete(index int) (interface{}, bool) {
 //	println(l.Slice(-1, 2))  // Output: [1 2]
 //	println(l.Slice(3, 999)) // Output: [4 5]
 //	println(l.Slice(3, 2))   // Output: nil
-func (l *List) Slice(startIndex, endIndex int) []interface{} {
+func (l *List) Slice(startIndex, endIndex int) []any {
 	size := l.tree.Size()
 
 	// Normalize bounds
@@ -217,10 +217,10 @@ func (l *List) Slice(startIndex, endIndex int) []interface{} {
 	}
 
 	count := endIndex - startIndex
-	result := make([]interface{}, count)
+	result := make([]any, count)
 
 	i := 0
-	l.tree.IterateByOffset(startIndex, count, func(_ string, value interface{}) bool {
+	l.tree.IterateByOffset(startIndex, count, func(_ string, value any) bool {
 		result[i] = value
 		i++
 		return false
@@ -229,13 +229,13 @@ func (l *List) Slice(startIndex, endIndex int) []interface{} {
 }
 
 // ForEach iterates through all elements in the list.
-func (l *List) ForEach(fn func(index int, value interface{}) bool) {
+func (l *List) ForEach(fn func(index int, value any) bool) {
 	if l.tree.Size() == 0 {
 		return
 	}
 
 	index := 0
-	l.tree.IterateByOffset(0, l.tree.Size(), func(_ string, value interface{}) bool {
+	l.tree.IterateByOffset(0, l.tree.Size(), func(_ string, value any) bool {
 		result := fn(index, value)
 		index++
 		return result
@@ -265,7 +265,7 @@ func (l *List) Clone() *List {
 		return newList
 	}
 
-	l.tree.IterateByOffset(0, size, func(_ string, value interface{}) bool {
+	l.tree.IterateByOffset(0, size, func(_ string, value any) bool {
 		newList.Append(value)
 		return false
 	})
@@ -300,7 +300,7 @@ func (l *List) DeleteRange(startIndex, endIndex int) int {
 
 	// Collect keys to delete
 	keysToDelete := make([]string, 0, endIndex-startIndex)
-	l.tree.IterateByOffset(startIndex, endIndex-startIndex, func(key string, _ interface{}) bool {
+	l.tree.IterateByOffset(startIndex, endIndex-startIndex, func(key string, _ any) bool {
 		keysToDelete = append(keysToDelete, key)
 		return false
 	})

examples/gno.land/p/demo/avl/list/list_test.gno

@@ -69,7 +69,7 @@ func TestList_Set(t *testing.T) {
 	}
 
 	// Verify list state hasn't changed after invalid operations
-	expected := []interface{}{1, 42, 3, 4}
+	expected := []any{1, 42, 3, 4}
 	for i, want := range expected {
 		if got := l.Get(i); got != want {
 			t.Errorf("index %d = %v; want %v", i, got, want)
@@ -107,16 +107,16 @@ func TestList_Slice(t *testing.T) {
 
 	// Test valid ranges
 	values := l.Slice(1, 4)
-	expected := []interface{}{2, 3, 4}
+	expected := []any{2, 3, 4}
 	if !sliceEqual(values, expected) {
 		t.Errorf("Slice(1,4) = %v; want %v", values, expected)
 	}
 
 	// Test edge cases
-	if values := l.Slice(-1, 2); !sliceEqual(values, []interface{}{1, 2}) {
+	if values := l.Slice(-1, 2); !sliceEqual(values, []any{1, 2}) {
 		t.Errorf("Slice(-1,2) = %v; want [1 2]", values)
 	}
-	if values := l.Slice(3, 10); !sliceEqual(values, []interface{}{4, 5}) {
+	if values := l.Slice(3, 10); !sliceEqual(values, []any{4, 5}) {
 		t.Errorf("Slice(3,10) = %v; want [4 5]", values)
 	}
 	if values := l.Slice(3, 2); values != nil {
@@ -129,7 +129,7 @@ func TestList_ForEach(t *testing.T) {
 	l.Append(1, 2, 3)
 
 	sum := 0
-	l.ForEach(func(index int, value interface{}) bool {
+	l.ForEach(func(index int, value any) bool {
 		sum += value.(int)
 		return false
 	})
@@ -140,7 +140,7 @@ func TestList_ForEach(t *testing.T) {
 
 	// Test early termination
 	count := 0
-	l.ForEach(func(index int, value interface{}) bool {
+	l.ForEach(func(index int, value any) bool {
 		count++
 		return true // stop after first item
 	})
@@ -187,7 +187,7 @@ func TestList_DeleteRange(t *testing.T) {
 	if l.Len() != 2 {
 		t.Errorf("after DeleteRange(1,4) len = %d; want 2", l.Len())
 	}
-	expected := []interface{}{1, 5}
+	expected := []any{1, 5}
 	for i, want := range expected {
 		if got := l.Get(i); got != want {
 			t.Errorf("after DeleteRange(1,4) index %d = %v; want %v", i, got, want)
@@ -281,7 +281,7 @@ func TestList_LargeOperations(t *testing.T) {
 
 	// Test range on large list
 	values := l.Slice(n-3, n)
-	expected := []interface{}{n - 3, n - 2, n - 1}
+	expected := []any{n - 3, n - 2, n - 1}
 	if !sliceEqual(values, expected) {
 		t.Errorf("Range(%d,%d) = %v; want %v", n-3, n, values, expected)
 	}
@@ -305,7 +305,7 @@ func TestList_ChainedOperations(t *testing.T) {
 	l.Append(4)
 	l.Set(1, 5)
 
-	expected := []interface{}{1, 5, 4}
+	expected := []any{1, 5, 4}
 	for i, want := range expected {
 		if got := l.Get(i); got != want {
 			t.Errorf("index %d = %v; want %v", i, got, want)
@@ -320,10 +320,10 @@ func TestList_RangeEdgeCases(t *testing.T) {
 	// Test various edge cases for Range
 	cases := []struct {
 		start, end int
-		want       []interface{}
+		want       []any
 	}{
-		{-10, 2, []interface{}{1, 2}},
-		{3, 10, []interface{}{4, 5}},
+		{-10, 2, []any{1, 2}},
+		{3, 10, []any{4, 5}},
 		{0, 0, nil},
 		{5, 5, nil},
 		{4, 3, nil},
@@ -357,7 +357,7 @@ func TestList_IndexConsistency(t *testing.T) {
 	l.Append(8, 9, 10) // [1,6,7,8,9,10]
 
 	// Verify sequence is continuous
-	expected := []interface{}{1, 6, 7, 8, 9, 10}
+	expected := []any{1, 6, 7, 8, 9, 10}
 	for i, want := range expected {
 		if got := l.Get(i); got != want {
 			t.Errorf("index %d = %v; want %v", i, got, want)
@@ -376,9 +376,9 @@ func TestList_IndexConsistency(t *testing.T) {
 	}
 
 	// Verify no gaps in iteration
-	var iteratedValues []interface{}
+	var iteratedValues []any
 	var indices []int
-	l.ForEach(func(index int, value interface{}) bool {
+	l.ForEach(func(index int, value any) bool {
 		iteratedValues = append(iteratedValues, value)
 		indices = append(indices, index)
 		return false
@@ -408,7 +408,7 @@ func TestList_RecursiveSafety(t *testing.T) {
 
 	// Test deep list traversal
 	found := false
-	l.ForEach(func(i int, v interface{}) bool {
+	l.ForEach(func(i int, v any) bool {
 		if str, ok := v.(string); ok {
 			if str == "id2" {
 				found = true
@@ -432,7 +432,7 @@ func TestList_RecursiveSafety(t *testing.T) {
 		if !short {
 			// Search for a value
 			var lastFound bool
-			l.ForEach(func(j int, v interface{}) bool {
+			l.ForEach(func(j int, v any) bool {
 				if str, ok := v.(string); ok {
 					if str == ufmt.Sprintf("id%d", i+3) {
 						lastFound = true
@@ -460,7 +460,7 @@ func TestList_RecursiveSafety(t *testing.T) {
 }
 
 // Helper function to compare slices
-func sliceEqual(a, b []interface{}) bool {
+func sliceEqual(a, b []any) bool {
 	if len(a) != len(b) {
 		return false
 	}