Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 16 for dumpfields (0.18 sec)

  1. src/go/types/resolver.go

    						if name == "main" {
    							code = InvalidMainDecl
    						}
    						if d.decl.Type.TypeParams.NumFields() != 0 {
    							check.softErrorf(d.decl.Type.TypeParams.List[0], code, "func %s must have no type parameters", name)
    							hasTParamError = true
    						}
    						if t := d.decl.Type; t.Params.NumFields() != 0 || t.Results != nil {
    							// TODO(rFindley) Should this be a hard error?
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 16:22:59 UTC 2024
    - 26.1K bytes
    - Viewed (0)
  2. src/go/types/predicates.go

    		// and identical tags. Two embedded fields are considered to have the same
    		// name. Lower-case field names from different packages are always different.
    		if y, ok := y.(*Struct); ok {
    			if x.NumFields() == y.NumFields() {
    				for i, f := range x.fields {
    					g := y.fields[i]
    					if f.embedded != g.embedded ||
    						!c.ignoreTags && x.Tag(i) != y.Tag(i) ||
    						!f.sameId(g.pkg, g.name, false) ||
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:01:18 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/types2/predicates.go

    		// and identical tags. Two embedded fields are considered to have the same
    		// name. Lower-case field names from different packages are always different.
    		if y, ok := y.(*Struct); ok {
    			if x.NumFields() == y.NumFields() {
    				for i, f := range x.fields {
    					g := y.fields[i]
    					if f.embedded != g.embedded ||
    						!c.ignoreTags && x.Tag(i) != y.Tag(i) ||
    						!f.sameId(g.pkg, g.name, false) ||
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:01:18 UTC 2024
    - 17.5K bytes
    - Viewed (0)
  4. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/asmdecl/asmdecl.go

    	case asmStruct:
    		tu := t.Underlying().(*types.Struct)
    		fields := make([]*types.Var, tu.NumFields())
    		for i := 0; i < tu.NumFields(); i++ {
    			fields[i] = tu.Field(i)
    		}
    		offsets := arch.sizes.Offsetsof(fields)
    		for i, f := range fields {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 02:38:00 UTC 2024
    - 22.8K bytes
    - Viewed (0)
  5. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/copylock/copylock.go

    	// TODO(adonovan): remove workaround when we drop go1.10.
    	if analysisutil.IsNamedType(typ, "sync", "noCopy") {
    		return []string{typ.String()}
    	}
    
    	nfields := styp.NumFields()
    	for i := 0; i < nfields; i++ {
    		ftyp := styp.Field(i).Type()
    		subpath := lockPath(tpkg, ftyp, seen)
    		if subpath != nil {
    			return append(subpath, typ.String())
    		}
    	}
    
    	return nil
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 04 16:19:04 UTC 2024
    - 9.9K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/walk/assign.go

    // check assign type list to
    // an expression list. called in
    //
    //	expr-list = func()
    func ascompatet(nl ir.Nodes, nr *types.Type) []ir.Node {
    	if len(nl) != nr.NumFields() {
    		base.Fatalf("ascompatet: assignment count mismatch: %d = %d", len(nl), nr.NumFields())
    	}
    
    	var nn ir.Nodes
    	for i, l := range nl {
    		if ir.IsBlank(l) {
    			continue
    		}
    		r := nr.Field(i)
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 17:09:06 UTC 2024
    - 20.3K bytes
    - Viewed (0)
  7. src/go/types/unify.go

    		// and they have identical tags. Two embedded fields are considered to have the same
    		// name. Lower-case field names from different packages are always different.
    		if y, ok := y.(*Struct); ok {
    			if x.NumFields() == y.NumFields() {
    				for i, f := range x.fields {
    					g := y.fields[i]
    					if f.embedded != g.embedded ||
    						x.Tag(i) != y.Tag(i) ||
    						!f.sameId(g.pkg, g.name, false) ||
    						!u.nify(f.typ, g.typ, emode, p) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 11 16:24:39 UTC 2024
    - 27.9K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/types2/unify.go

    		// and they have identical tags. Two embedded fields are considered to have the same
    		// name. Lower-case field names from different packages are always different.
    		if y, ok := y.(*Struct); ok {
    			if x.NumFields() == y.NumFields() {
    				for i, f := range x.fields {
    					g := y.fields[i]
    					if f.embedded != g.embedded ||
    						x.Tag(i) != y.Tag(i) ||
    						!f.sameId(g.pkg, g.name, false) ||
    						!u.nify(f.typ, g.typ, emode, p) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 11 16:24:39 UTC 2024
    - 27.8K bytes
    - Viewed (0)
  9. src/go/types/decl.go

    	}).describef(obj, "validType(%s)", obj.Name())
    
    	// First type parameter, or nil.
    	var tparam0 *ast.Field
    	if tdecl.TypeParams.NumFields() > 0 {
    		tparam0 = tdecl.TypeParams.List[0]
    	}
    
    	// alias declaration
    	if tdecl.Assign.IsValid() {
    		// Report highest version requirement first so that fixing a version issue
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 31K bytes
    - Viewed (0)
  10. src/cmd/vendor/golang.org/x/tools/go/types/typeutil/map.go

    	case *types.Array:
    		return 9043 + 2*uint32(t.Len()) + 3*h.Hash(t.Elem())
    
    	case *types.Slice:
    		return 9049 + 2*h.Hash(t.Elem())
    
    	case *types.Struct:
    		var hash uint32 = 9059
    		for i, n := 0, t.NumFields(); i < n; i++ {
    			f := t.Field(i)
    			if f.Anonymous() {
    				hash += 8861
    			}
    			hash += hashString(t.Tag(i))
    			hash += hashString(f.Name()) // (ignore f.Pkg)
    			hash += h.Hash(f.Type())
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 02:38:00 UTC 2024
    - 13.9K bytes
    - Viewed (0)
Back to top