This is a port of CL 332555 to go/types.
Change-Id: I9b26bba8b605f5bbbd8f0f81fd6651a4a3ff4b57
Reviewed-on: https://go-review.googlesource.com/c/go/+/335111
Reviewed-by: Robert Griesemer <gri@golang.org>
Trust: Robert Findley <rfindley@google.com>
Run-TryBot: Robert Findley <rfindley@google.com>
TryBot-Result: Go Bot <gobot@golang.org>
return
}
var src Type
- switch t := optype(y.typ).(type) {
+ switch t := under(y.typ).(type) {
case *Basic:
if isString(y.typ) {
src = universeByte
}
case *Slice:
src = t.elem
+ case *TypeParam:
+ check.error(x, _Todo, "copy on generic operands not yet implemented")
}
if dst == nil || src == nil {
var valid func(t Type) bool
valid = func(t Type) bool {
var m int
- switch t := optype(t).(type) {
+ switch t := under(t).(type) {
case *Slice:
m = 2
case *Map, *Chan:
m = 1
- case *Union:
+ case *TypeParam:
return t.underIs(valid)
default:
return false
return x.typ, nil, 0
}
- switch t := optype(target).(type) {
+ switch t := under(target).(type) {
case *Basic:
if x.mode == constant_ {
v, code := check.representation(x, t)
default:
return nil, nil, _InvalidUntypedConversion
}
- case *Union:
+ case *TypeParam:
ok := t.underIs(func(t Type) bool {
target, _, _ := check.implicitTypeAndValue(x, t)
return target != nil
goto Error
}
- switch utyp := optype(base).(type) {
+ switch utyp := under(base).(type) {
case *Struct:
if len(e.Elts) == 0 {
break
valid := false
length := int64(-1) // valid if >= 0
- switch typ := optype(x.typ).(type) {
+ switch typ := under(x.typ).(type) {
case *Basic:
if isString(typ) {
if e.Slice3 {
valid = true
// x.typ doesn't change
- case *Union, *TypeParam:
- check.errorf(x, 0, "generic slice expressions not yet implemented")
+ case *TypeParam:
+ check.errorf(x, _Todo, "generic slice expressions not yet implemented")
x.mode = invalid
return
}
}
func is(typ Type, what BasicInfo) bool {
- switch t := optype(typ).(type) {
+ switch t := under(typ).(type) {
case *Basic:
return t.info&what != 0
- case *Union:
+ case *TypeParam:
return t.underIs(func(typ Type) bool { return is(typ, what) })
}
return false
seen[T] = true
// If T is a type parameter not constrained by any type
- // list (i.e., it's operational type is the top type),
+ // (i.e., it's operational type is the top type),
// T is comparable if it has the == method. Otherwise,
// the operational type "wins". For instance
//
// interface{ comparable; type []byte }
//
// is not comparable because []byte is not comparable.
+ // TODO(gri) this code is not 100% correct (see comment for TypeSet.IsComparable)
if t := asTypeParam(T); t != nil && optype(t) == theTop {
return t.Bound().IsComparable()
}
- switch t := optype(T).(type) {
+ switch t := under(T).(type) {
case *Basic:
// assume invalid types to be comparable
// to avoid follow-up errors
return true
case *Array:
return comparable(t.elem, seen)
- case *Union:
+ case *TypeParam:
return t.underIs(func(t Type) bool {
return comparable(t, seen)
})
- case *TypeParam:
- return t.Bound().IsComparable()
}
return false
}
// hasNil reports whether a type includes the nil value.
func hasNil(typ Type) bool {
- switch t := optype(typ).(type) {
+ switch t := under(typ).(type) {
case *Basic:
return t.kind == UnsafePointer
case *Slice, *Pointer, *Signature, *Interface, *Map, *Chan:
return true
- case *Union:
+ case *TypeParam:
return t.underIs(hasNil)
}
return false
// slicing
// TODO(gri) implement this
-func _[T interface{ ~string }] (x T, i, j, k int) { _ = x /* ERROR invalid operation */ [i:j:k] }
+func _[T interface{ ~string }] (x T, i, j, k int) { _ = x /* ERROR generic slice expressions not yet implemented */ [i:j:k] }
// len/cap built-ins
func (s *TypeSet) IsMethodSet() bool { return s.types == nil && !s.IsComparable() }
// IsComparable reports whether each type in the set is comparable.
+// TODO(gri) this is not correct - there may be s.types values containing non-comparable types
func (s *TypeSet) IsComparable() bool {
_, m := s.LookupMethod(nil, "==")
return m != nil