Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 210 for Map (0.04 sec)

  1. src/internal/trace/reader.go

    			go121Events: convertOldFormat(tr),
    		}, nil
    	case version.Go122, version.Go123:
    		return &Reader{
    			r: br,
    			order: ordering{
    				mStates:     make(map[ThreadID]*mState),
    				pStates:     make(map[ProcID]*pState),
    				gStates:     make(map[GoID]*gState),
    				activeTasks: make(map[TaskID]taskState),
    			},
    			// Don't emit a sync event when we first go to emit events.
    			emittedSync: true,
    		}, nil
    	default:
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 6.7K bytes
    - Viewed (0)
  2. test/linknameasm.dir/x.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Test that a linkname applied on an assembly declaration
    // does not affect stack map generation.
    
    package main
    
    import (
    	"runtime"
    	_ "unsafe"
    )
    
    //go:linkname asm
    func asm(*int)
    
    func main() {
    	x := new(int)
    	asm(x)
    }
    
    // called from asm
    func callback() {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 15:22:22 UTC 2024
    - 451 bytes
    - Viewed (0)
  3. src/cmd/fix/main.go

    		os.Exit(exitCode)
    	}
    
    	sort.Sort(byDate(fixes))
    
    	if *allowedRewrites != "" {
    		allowed = make(map[string]bool)
    		for _, f := range strings.Split(*allowedRewrites, ",") {
    			allowed[f] = true
    		}
    	}
    
    	if *forceRewrites != "" {
    		force = make(map[string]bool)
    		for _, f := range strings.Split(*forceRewrites, ",") {
    			force[f] = true
    		}
    	}
    
    	if flag.NArg() == 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 14 19:41:17 UTC 2024
    - 5.4K bytes
    - Viewed (0)
  4. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/unusedresult/unusedresult.go

    	false)
    
    type stringSetFlag map[string]bool
    
    func (ss *stringSetFlag) String() string {
    	var items []string
    	for item := range *ss {
    		items = append(items, item)
    	}
    	sort.Strings(items)
    	return strings.Join(items, ",")
    }
    
    func (ss *stringSetFlag) Set(s string) error {
    	m := make(map[string]bool) // clobber previous value
    	if s != "" {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jan 22 19:00:13 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  5. src/net/http/clone.go

    //
    //go:linkname cloneMultipartForm
    func cloneMultipartForm(f *multipart.Form) *multipart.Form {
    	if f == nil {
    		return nil
    	}
    	f2 := &multipart.Form{
    		Value: (map[string][]string)(Header(f.Value).Clone()),
    	}
    	if f.File != nil {
    		m := make(map[string][]*multipart.FileHeader)
    		for k, vv := range f.File {
    			vv2 := make([]*multipart.FileHeader, len(vv))
    			for i, v := range vv {
    				vv2[i] = cloneMultipartFileHeader(v)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:17:26 UTC 2024
    - 3K bytes
    - Viewed (0)
  6. src/runtime/symtabinl_test.go

    	f := findfunc(pc1)
    	if !f.valid() {
    		t.Fatalf("failed to resolve tiuTest at PC %#x", pc1)
    	}
    
    	want := map[string]int{
    		"tiuInlined1:3 tiuTest:10":               0,
    		"tiuInlined1:3 tiuInlined2:6 tiuTest:11": 0,
    		"tiuInlined2:7 tiuTest:11":               0,
    		"tiuTest:12":                             0,
    	}
    	wantStart := map[string]int{
    		"tiuInlined1": 2,
    		"tiuInlined2": 5,
    		"tiuTest":     9,
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 15:41:45 UTC 2024
    - 3K bytes
    - Viewed (0)
  7. src/internal/trace/internal/testgen/go122/trace.go

    // creating complex traces that are mostly or completely correct.
    func (t *Trace) Generation(gen uint64) *Generation {
    	g := &Generation{
    		trace:   t,
    		gen:     gen,
    		strings: make(map[string]uint64),
    		stacks:  make(map[stack]uint64),
    	}
    	t.gens = append(t.gens, g)
    	return g
    }
    
    // Generate creates a test file for the trace.
    func (t *Trace) Generate() []byte {
    	// Trace file contents.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 9.7K bytes
    - Viewed (0)
  8. src/cmd/internal/dwarf/putvarabbrevgen_test.go

    	var fset token.FileSet
    	f, err := parser.ParseFile(&fset, "./dwarf.go", nil, parser.ParseComments)
    	if err != nil {
    		t.Fatal(err)
    	}
    	cm := ast.NewCommentMap(&fset, f, f.Comments)
    	abbrevs := make(map[string]int)
    	funcs := map[string]ast.Stmt{}
    	for _, decl := range f.Decls {
    		decl, ok := decl.(*ast.FuncDecl)
    		if !ok || decl.Body == nil {
    			continue
    		}
    		if decl.Name.Name == "putvar" || decl.Name.Name == "putAbstractVar" {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 26 20:45:07 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  9. src/runtime/covermeta.go

    	id := rtcov.AddMeta(p, dlen, hash, pkgpath, pkgid, cmode, cgran)
    	if id == 0 {
    		throw("runtime.addCovMeta: coverage package map collision")
    	}
    	return id
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 09:57:47 UTC 2024
    - 603 bytes
    - Viewed (0)
  10. src/net/http/servemux121.go

    		use121 = true
    		httpmuxgo121.IncNonDefault()
    	}
    }
    
    // serveMux121 holds the state of a ServeMux needed for Go 1.21 behavior.
    type serveMux121 struct {
    	mu    sync.RWMutex
    	m     map[string]muxEntry
    	es    []muxEntry // slice of entries sorted from longest to shortest.
    	hosts bool       // whether any patterns contain hostnames
    }
    
    type muxEntry struct {
    	h       Handler
    	pattern string
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 18 15:40:38 UTC 2024
    - 5.8K bytes
    - Viewed (0)
Back to top