Method typeToTypeNode

internal/checker/nodebuilderimpl.go:3176–3493

(t *Type)

}

func (b *NodeBuilderImpl) typeToTypeNode(t *Type) *ast.TypeNode {
	// Push type onto typeStack for expansion depth tracking
	if b.ctx.maxExpansionDepth >= 0 && t != nil {
		b.ctx.typeStack = append(b.ctx.typeStack, t)
		defer func() {
			b.ctx.typeStack = b.ctx.typeStack[:len(b.ctx.typeStack)-1]
		}()
	}

	inTypeAlias := b.ctx.flags & nodebuilder.FlagsInTypeAlias
	b.ctx.flags &^= nodebuilder.FlagsInTypeAlias

	if t == nil {
		if b.ctx.flags&nodebuilder.FlagsAllowEmptyUnionOrIntersection == 0 {
			b.ctx.encounteredError = true
			return nil
			// TODO: GH#18217
		}
		b.ctx.approximateLength += 3
		return b.f.NewKeywordTypeNode(ast.KindAnyKeyword)
	}

	if b.ctx.flags&nodebuilder.FlagsNoTypeReduction == 0 {
		t = b.ch.getReducedType(t)
	}

	if t.flags&TypeFlagsAny != 0 {
		if t.alias != nil {
			return t.alias.ToTypeReferenceNode(b)
		}
		if t == b.ch.unresolvedType {
			return b.e.AddSyntheticLeadingComment(b.f.NewKeywordTypeNode(ast.KindAnyKeyword), ast.KindMultiLineCommentTrivia, "unresolved", false /*hasTrailingNewLine*/)
		}
		b.ctx.approximateLength += 3
		return b.f.NewKeywordTypeNode(core.IfElse(t == b.ch.intrinsicMarkerType, ast.KindIntrinsicKeyword, ast.KindAnyKeyword))
	}
	if t.flags&TypeFlagsUnknown != 0 {
		return b.f.NewKeywordTypeNode(ast.KindUnknownKeyword)
	}
	if t.flags&TypeFlagsString != 0 {
		b.ctx.approximateLength += 6
		return b.f.NewKeywordTypeNode(ast.KindStringKeyword)
	}
	if t.flags&TypeFlagsNumber != 0 {
		b.ctx.approximateLength += 6
		return b.f.NewKeywordTypeNode(ast.KindNumberKeyword)
	}
	if t.flags&TypeFlagsBigInt != 0 {
		b.ctx.approximateLength += 6
		return b.f.NewKeywordTypeNode(ast.KindBigIntKeyword)
	}
	if t.flags&TypeFlagsBoolean != 0 && t.alias == nil {
		b.ctx.approximateLength += 7
		return b.f.NewKeywordTypeNode(ast.KindBooleanKeyword)
	}
	expandingEnum := false
	if t.flags&TypeFlagsEnumLike != 0 {
		if t.symbol.Flags&ast.SymbolFlagsEnumMember != 0 {