- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 343 for Map (0.07 sec)
-
src/sync/map_test.go
for _, c := range calls { v, ok := c.apply(m) results = append(results, mapResult{v, ok}) } final = make(map[any]any) m.Range(func(k, v any) bool { final[k] = v return true }) return results, final } func applyMap(calls []mapCall) ([]mapResult, map[any]any) { return applyCalls(new(sync.Map), calls) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 01 15:34:22 UTC 2024 - 8.1K bytes - Viewed (0) -
src/internal/coverage/cformat/format.go
) type Formatter struct { // Maps import path to package state. pm map[string]*pstate // Records current package being visited. pkg string // Pointer to current package state. p *pstate // Counter mode. cm coverage.CounterMode } // pstate records package-level coverage data state: // - a table of functions (file/fname/literal) // - a map recording the index/ID of each func encountered so far
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/slog/slog.go
var kvFuncs = map[string]map[string]int{ "": map[string]int{ "Debug": 1, "Info": 1, "Warn": 1, "Error": 1, "DebugContext": 2, "InfoContext": 2, "WarnContext": 2, "ErrorContext": 2, "Log": 3, "Group": 1, }, "Logger": map[string]int{ "Debug": 1, "Info": 1,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 7.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/internal/match.go
func NewInheritanceMatcher(t []language.Tag) *InheritanceMatcher { tags := &InheritanceMatcher{make(map[language.Tag]int)} for i, tag := range t { ct, err := language.All.Canonicalize(tag) if err != nil { ct = tag } tags.index[ct] = i } return tags } type InheritanceMatcher struct { index map[language.Tag]int }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 1.9K bytes - Viewed (0) -
src/cmd/internal/src/xpos.go
return p } // A PosTable tracks Pos -> XPos conversions and vice versa. // Its zero value is a ready-to-use PosTable. type PosTable struct { baseList []*PosBase indexMap map[*PosBase]int nameMap map[string]int // Maps file symbol name to index for debug information. } // XPos returns the corresponding XPos for the given pos, // adding pos to t if necessary. func (t *PosTable) XPos(pos Pos) XPos {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 4.9K bytes - Viewed (0) -
src/reflect/iter_test.go
// license that can be found in the LICENSE file. package reflect_test import ( "iter" "maps" . "reflect" "testing" ) func TestValueSeq(t *testing.T) { m := map[string]int{ "1": 1, "2": 2, "3": 3, "4": 4, } c := make(chan int, 3) for i := range 3 { c <- i } close(c) tests := []struct { name string val Value
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 10 14:27:54 UTC 2024 - 6.4K bytes - Viewed (0) -
src/internal/trace/event/event.go
"stack", // stack ID "value", // uint64 "task", // trace.TaskID } // Names is a helper that produces a mapping of event names to event types. func Names(specs []Spec) map[string]Type { nameToType := make(map[string]Type) for i, spec := range specs { nameToType[spec.Name] = Type(byte(i)) } return nameToType } // Experiment is an experiment ID that events may be associated with.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 3.4K bytes - Viewed (0) -
src/go/parser/testdata/issue23434.src
// parser after missing type. There should be exactly // one error each time, with now follow errors. package p func g() { m := make(map[string]! /* ERROR "expected type, found '!'" */ ) for { x := 1 print(x) } } func f() { m := make(map[string]) /* ERROR "expected type, found '\)'" */ for { x := 1 print(x) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 02 12:56:53 UTC 2023 - 553 bytes - Viewed (0) -
src/testing/slogtest/run_test.go
) func TestRun(t *testing.T) { var buf bytes.Buffer newHandler := func(*testing.T) slog.Handler { buf.Reset() return slog.NewJSONHandler(&buf, nil) } result := func(t *testing.T) map[string]any { m := map[string]any{} if err := json.Unmarshal(buf.Bytes(), &m); err != nil { t.Fatal(err) } return m } slogtest.Run(t, newHandler, result)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 20:37:12 UTC 2023 - 623 bytes - Viewed (0) -
test/typeparam/graph.go
// as an ordered list of edges. If there are multiple shortest paths, // which one is returned is unpredictable. func (g *_Graph[_Node, _Edge]) ShortestPath(from, to _Node) ([]_Edge, error) { visited := make(map[_Node]bool) visited[from] = true workqueue := []nodePath[_Node, _Edge]{nodePath[_Node, _Edge]{from, nil}} for len(workqueue) > 0 { current := workqueue workqueue = nil for _, np := range current {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 5.7K bytes - Viewed (0)