func isTypeElem(x ast.Expr) bool {
	switch x := x.(type) {
	case *ast.ArrayType, *ast.StructType, *ast.FuncType, *ast.InterfaceType, *ast.MapType, *ast.ChanType:
		return true
	case *ast.UnaryExpr:
		return x.Op == token.TILDE
	case *ast.BinaryExpr:
		return isTypeElem(x.X) || isTypeElem(x.Y)
	case *ast.ParenExpr:
		return isTypeElem(x.X)
	}
	return false
}

func (p *printer) signature(sig *ast.FuncType) {

e}(O1.default);zr.default=D1;sp.exports=zr.default});var op=v((nn,ap)=>{l();"use strict";nn.__esModule=!0;nn.default=I1;function I1(i){return i.sort(function(e,t){return e-t})}ap.exports=nn.default});var ya=v(D=>{l();"use strict";D.__esModule=!0;D.word=D.tilde=D.tab=D.str=D.space=D.slash=D.singleQuote=D.semicolon=D.plus=D.pipe=D.openSquare=D.openParenthesis=D.newline=D.greaterThan=D.feed=D.equals=D.doubleQuote=D.dollar=D.cr=D.comment=D.comma=D.combinator=D.colon=D.closeSquare=D.closeParenthesis=D.caret=...

		{"SHR", Const, 0},
		{"SHR_ASSIGN", Const, 0},
		{"STRING", Const, 0},
		{"STRUCT", Const, 0},
		{"SUB", Const, 0},
		{"SUB_ASSIGN", Const, 0},
		{"SWITCH", Const, 0},
		{"TILDE", Const, 18},
		{"TYPE", Const, 0},
		{"Token", Type, 0},
		{"UnaryPrec", Const, 0},
		{"VAR", Const, 0},
		{"XOR", Const, 0},
		{"XOR_ASSIGN", Const, 0},
	},
	"go/types": {

	<code>core(C)</code> and <code>A</code> must unify loosely.
	If <code>P</code> does not have a known type argument
	and <code>C</code> contains exactly one type term <code>T</code>
	that is not an underlying (tilde) type, unification adds the
	mapping <code>P ➞ T</code> to the map.
</li>
<li>
	If <code>C</code> does not have a core type
	and <code>P</code> has a known type argument <code>A</code>,