blob: 84329e2b9eb8ce083e39ba29a8e535c9bcba9925 [file] [log] [blame]
package stditerators
import "go/types"
func _(tuple *types.Tuple) {
for v := range tuple.Variables() { // want "Len/At loop can simplified using Tuple.Variables iteration"
print(v)
}
}
func _(scope *types.Scope) {
for child := range scope.Children() { // want "NumChildren/Child loop can simplified using Scope.Children iteration"
print(child)
}
{
const child = 0 // shadowing of preferred name at def
for child0 := range scope.Children() { // want "NumChildren/Child loop can simplified using Scope.Children iteration"
print(child0)
}
}
{
for i := 0; i < scope.NumChildren(); i++ {
const child = 0 // nope: shadowing of fresh name at use
print(scope.Child(i))
}
}
{
for elem := range scope.Children() { // want "NumChildren/Child loop can simplified using Scope.Children iteration"
elem := elem // => preferred name = "elem"
print(elem)
}
}
{
for child := range scope.Children() { // want "NumChildren/Child loop can simplified using Scope.Children iteration"
first := scope.Child(0) // the name heuristic should not be fooled by this
print(first, child)
}
}
}
func _(union, union2 *types.Union) {
for term := range union.Terms() { // want "Len/Term loop can simplified using Union.Terms iteration"
print(term)
print(term)
}
for i := union.Len() - 1; i >= 0; i-- { // nope: wrong loop form
print(union.Term(i))
}
for i := 0; i <= union.Len(); i++ { // nope: wrong loop form
print(union.Term(i))
}
for i := 0; i <= union.Len(); i++ { // nope: use of i not in x.At(i)
print(i, union.Term(i))
}
for i := 0; i <= union.Len(); i++ { // nope: x.At and x.Len have different receivers
print(i, union2.Term(i))
}
}