diff options
Diffstat (limited to 'test')
-rw-r--r-- | test/typeparam/graph.go | 5 | ||||
-rw-r--r-- | test/typeparam/list2.go | 2 |
2 files changed, 4 insertions, 3 deletions
diff --git a/test/typeparam/graph.go b/test/typeparam/graph.go index 5cd1faa76f..544318647b 100644 --- a/test/typeparam/graph.go +++ b/test/typeparam/graph.go @@ -11,7 +11,7 @@ import ( "fmt" ) -// _Equal reports whether two slices are equal: the same length and all +// _SliceEqual reports whether two slices are equal: the same length and all // elements equal. All floating point NaNs are considered equal. func _SliceEqual[Elem comparable](s1, s2 []Elem) bool { if len(s1) != len(s2) { @@ -42,7 +42,7 @@ type _NodeC[_Edge any] interface { Edges() []_Edge } -// Edgec is the constraints on an edge in a graph, given the _Node type. +// _EdgeC is the constraints on an edge in a graph, given the _Node type. type _EdgeC[_Node any] interface { comparable Nodes() (a, b _Node) @@ -153,6 +153,7 @@ func (m mazeRoom) Edges() []mazeEdge { } // Nodes returns the rooms connected by an edge. +// //go:noinline func (e mazeEdge) Nodes() (mazeRoom, mazeRoom) { m1, ok := zork[e.from] diff --git a/test/typeparam/list2.go b/test/typeparam/list2.go index 111ac787e5..0b976f0b18 100644 --- a/test/typeparam/list2.go +++ b/test/typeparam/list2.go @@ -14,7 +14,7 @@ import ( "strconv" ) -// Element is an element of a linked list. +// _Element is an element of a linked list. type _Element[T any] struct { // Next and previous pointers in the doubly-linked list of elements. // To simplify the implementation, internally a list l is implemented |