Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 42 for nextar (0.2 sec)

  1. src/runtime/pprof/proto.go

    	var line []byte
    	// next removes and returns the next field in the line.
    	// It also removes from line any spaces following the field.
    	next := func() []byte {
    		var f []byte
    		f, line, _ = bytes.Cut(line, space)
    		line = bytes.TrimLeft(line, " ")
    		return f
    	}
    
    	for len(data) > 0 {
    		line, data, _ = bytes.Cut(data, newline)
    		addr := next()
    		loStr, hiStr, ok := strings.Cut(string(addr), "-")
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Dec 13 20:40:52 UTC 2023
    - 25.7K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/types2/resolver.go

    	l := len(names)
    	r := len(inits)
    
    	const code = WrongAssignCount
    	switch {
    	case l < r:
    		n := inits[l]
    		if inherited {
    			check.errorf(pos, code, "extra init expr at %s", n.Pos())
    		} else {
    			check.errorf(n, code, "extra init expr %s", n)
    		}
    	case l > r && (constDecl || r != 1): // if r == 1 it may be a multi-valued function and we can't say anything yet
    		n := names[r]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 18 14:10:44 UTC 2024
    - 26.3K bytes
    - Viewed (0)
  3. src/go/types/resolver.go

    		}
    	case l < r:
    		if l < len(s.Values) {
    			// init exprs from s
    			n := s.Values[l]
    			check.errorf(n, code, "extra init expr %s", n)
    			// TODO(gri) avoid declared and not used error here
    		} else {
    			// init exprs "inherited"
    			check.errorf(s, code, "extra init expr at %s", check.fset.Position(init.Pos()))
    			// TODO(gri) avoid declared and not used error here
    		}
    	case l > r && (init != nil || r != 1):
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 16:22:59 UTC 2024
    - 26.1K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/types2/decl.go

    				check.declare(check.scope, name, lhs[i], scopePos)
    			}
    
    		case *syntax.VarDecl:
    			top := len(check.delayed)
    
    			lhs0 := make([]*Var, len(s.NameList))
    			for i, name := range s.NameList {
    				lhs0[i] = NewVar(name.Pos(), pkg, name.Value, nil)
    			}
    
    			// initialize all variables
    			values := syntax.UnpackListExpr(s.Values)
    			for i, obj := range lhs0 {
    				var lhs []*Var
    				var init syntax.Expr
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 29.6K bytes
    - Viewed (0)
  5. src/go/types/issues_test.go

    		t.Error("comparable not assignable to any")
    	}
    }
    
    func TestIssue55030(t *testing.T) {
    	// makeSig makes the signature func(typ...)
    	makeSig := func(typ Type) {
    		par := NewVar(nopos, nil, "", typ)
    		params := NewTuple(par)
    		NewSignatureType(nil, nil, nil, params, nil, true)
    	}
    
    	// makeSig must not panic for the following (example) types:
    	// []int
    	makeSig(NewSlice(Typ[Int]))
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 28.1K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/types2/issues_test.go

    		t.Error("comparable not assignable to any")
    	}
    }
    
    func TestIssue55030(t *testing.T) {
    	// makeSig makes the signature func(typ...)
    	makeSig := func(typ Type) {
    		par := NewVar(nopos, nil, "", typ)
    		params := NewTuple(par)
    		NewSignatureType(nil, nil, nil, params, nil, true)
    	}
    
    	// makeSig must not panic for the following (example) types:
    	// []int
    	makeSig(NewSlice(Typ[Int]))
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 28.1K bytes
    - Viewed (0)
  7. src/go/internal/gccgoimporter/parser.go

    		}
    
    		p.next()
    		if p.tok == '\'' {
    			p.next()
    			typ = types.Typ[types.UntypedRune]
    		} else {
    			typ = types.Typ[types.UntypedInt]
    		}
    
    	case scanner.Float:
    		re := sign + p.lit
    		p.next()
    
    		var im string
    		switch p.tok {
    		case '+':
    			p.next()
    			im = p.expect(scanner.Float)
    
    		case '-':
    			p.next()
    			im = "-" + p.expect(scanner.Float)
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 02 23:14:07 UTC 2024
    - 31.2K bytes
    - Viewed (0)
  8. src/go/types/decl.go

    				check.declare(check.scope, name, lhs[i], scopePos)
    			}
    
    		case varDecl:
    			top := len(check.delayed)
    
    			lhs0 := make([]*Var, len(d.spec.Names))
    			for i, name := range d.spec.Names {
    				lhs0[i] = NewVar(name.Pos(), pkg, name.Name, nil)
    			}
    
    			// initialize all variables
    			for i, obj := range lhs0 {
    				var lhs []*Var
    				var init ast.Expr
    				switch len(d.spec.Values) {
    				case len(d.spec.Names):
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 31K bytes
    - Viewed (0)
  9. test/escape2.go

    	p = &l
    	for p.Next != nil {
    		p = p.Next
    	}
    }
    
    func foo148(l List) { // ERROR "l does not escape$"
    	for p := &l; p.Next != nil; p = p.Next {
    	}
    }
    
    // related: address of variable should have depth of variable, not of loop
    
    func foo149(l List) { // ERROR "l does not escape$"
    	var p *List
    	for {
    		for p = &l; p.Next != nil; p = p.Next {
    		}
    	}
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Dec 14 17:22:18 UTC 2023
    - 35.1K bytes
    - Viewed (0)
  10. test/escape2n.go

    	p = &l
    	for p.Next != nil {
    		p = p.Next
    	}
    }
    
    func foo148(l List) { // ERROR "l does not escape$"
    	for p := &l; p.Next != nil; p = p.Next {
    	}
    }
    
    // related: address of variable should have depth of variable, not of loop
    
    func foo149(l List) { // ERROR "l does not escape$"
    	var p *List
    	for {
    		for p = &l; p.Next != nil; p = p.Next {
    		}
    	}
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Dec 14 17:22:18 UTC 2023
    - 35.1K bytes
    - Viewed (0)
Back to top