- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 111 for Map (0.04 sec)
-
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) -
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) -
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) -
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) -
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) -
src/cmd/trace/threadgen.go
logEventGenerator[trace.ThreadID] gStates map[trace.GoID]*gState[trace.ThreadID] threads map[trace.ThreadID]struct{} } func newThreadGenerator() *threadGenerator { tg := new(threadGenerator) rg := func(ev *trace.Event) trace.ThreadID { return ev.Thread() } tg.stackSampleGenerator.getResource = rg tg.logEventGenerator.getResource = rg tg.gStates = make(map[trace.GoID]*gState[trace.ThreadID])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 5.7K bytes - Viewed (0) -
src/runtime/covermeta.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 09:57:47 UTC 2024 - 603 bytes - Viewed (0) -
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) -
src/testing/fstest/mapfs.go
// // File system operations read directly from the map, // so that the file system can be changed by editing the map as needed. // An implication is that file system operations must not run concurrently // with changes to the map, which would be a race. // Another implication is that opening or reading a directory requires // iterating over the entire map, so a MapFS should typically be used with not more
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 7.1K bytes - Viewed (0) -
src/internal/dag/parse.go
package dag import ( "cmp" "fmt" "slices" "strings" ) type Graph struct { Nodes []string byLabel map[string]int edges map[string]map[string]bool } func newGraph() *Graph { return &Graph{byLabel: map[string]int{}, edges: map[string]map[string]bool{}} } func (g *Graph) addNode(label string) bool { if _, ok := g.byLabel[label]; ok { return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0)