Method mapToTypeNodes

internal/checker/nodebuilderimpl.go:337–428

(list []*Type, isBareList bool)

}

func (b *NodeBuilderImpl) mapToTypeNodes(list []*Type, isBareList bool) *ast.NodeList {
	if len(list) == 0 {
		return nil
	}

	if b.checkTruncationLength() {
		if !isBareList {
			var node *ast.Node
			if b.ctx.flags&nodebuilder.FlagsNoTruncation != 0 {
				node = b.e.AddSyntheticLeadingComment(b.f.NewKeywordTypeNode(ast.KindAnyKeyword), ast.KindMultiLineCommentTrivia, "elided", false /*hasTrailingNewLine*/)
			} else {
				node = b.f.NewTypeReferenceNode(b.f.NewIdentifier("..."), nil /*typeArguments*/)
			}
			return b.f.NewNodeList([]*ast.Node{node})
		} else if len(list) > 2 {
			nodes := []*ast.Node{
				b.typeToTypeNode(list[0]),
				nil,
				b.typeToTypeNode(list[len(list)-1]),
			}

			if b.ctx.flags&nodebuilder.FlagsNoTruncation != 0 {
				nodes[1] = b.e.AddSyntheticLeadingComment(b.f.NewKeywordTypeNode(ast.KindAnyKeyword), ast.KindMultiLineCommentTrivia, fmt.Sprintf("... %d more elided ...", len(list)-2), false /*hasTrailingNewLine*/)
			} else {
				text := fmt.Sprintf("... %d more ...", len(list)-2)
				nodes[1] = b.f.NewTypeReferenceNode(b.f.NewIdentifier(text), nil /*typeArguments*/)
			}
			return b.f.NewNodeList(nodes)
		}
	}

	mayHaveNameCollisions := b.ctx.flags&nodebuilder.FlagsUseFullyQualifiedType == 0
	type seenName struct {
		t *Type
		i int
	}
	var seenNames *collections.MultiMap[string, seenName]
	if mayHaveNameCollisions {
		seenNames = &collections.MultiMap[string, seenName]{}
	}

	result := make([]*ast.Node, 0, len(list))

	for i, t := range list {
		displayIndex := i + 1
		if b.checkTruncationLength() && (displayIndex+2 < len(list)-1) {
			if b.ctx.flags&nodebuilder.FlagsNoTruncation != 0 {
				result = append(result, b.e.AddSyntheticLeadingComment(b.f.NewKeywordTypeNode(ast.KindAnyKeyword), ast.KindMultiLineCommentTrivia, fmt.Sprintf("... %d more elided ...", len(list)-displayIndex), false /*hasTrailingNewLine*/))
			} else {
				text := fmt.Sprintf("... %d more ...", len(list)-displayIndex)
				result = append(result, b.f.NewTypeReferenceNode(b.f.NewIdentifier(text), nil /*typeArguments*/))
			}
			typeNode := b.typeToTypeNode(list[len(list)-1])
			if typeNode != nil {
				result = append(result, typeNode)
			}
			break
		}