go-blog: Type Construction and Cycle Detection

// This program demonstrates a simple recursive type that compiles
// thanks to Go 1.26's improved type construction. It prints the
// size of the slice element type to show that the compiler has
// resolved the recursion.

package main

import (
	"fmt"
	"unsafe"
)

// Node is a recursive type: each node points to another Node.
type Node struct {
	next *Node
}

func main() {
	// Create a slice of Nodes to exercise the recursive type.
	nodes := make([]Node, 3)

	// Link the nodes together.
	for i := 0; i < 2; i++ {
		nodes[i].next = &nodes[i+1]
	}

	// Print the size of the Node type to confirm the compiler
	// has constructed it correctly. The size includes a pointer.
	fmt.Printf("Size of Node: %d bytes\n", unsafe.Sizeof(Node{}))
}