- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 133 for Map (0.03 sec)
-
src/go/types/resolver_test.go
files = append(files, mustParse(fset, src)) } // resolve and type-check package AST importer := new(resolveTestImporter) conf := Config{Importer: importer} uses := make(map[*ast.Ident]Object) defs := make(map[*ast.Ident]Object) _, err := conf.Check("testResolveIdents", fset, files, &Info{Defs: defs, Uses: uses}) if err != nil { t.Fatal(err) } // check that all packages were imported
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 4.5K bytes - Viewed (0) -
src/cmd/go/internal/par/work.go
) // Work manages a set of work items to be executed in parallel, at most once each. // The items in the set must all be valid map keys. type Work[T comparable] struct { f func(T) // function to run for each item running int // total number of runners mu sync.Mutex added map[T]bool // items added to set todo []T // items yet to be run wait sync.Cond // wait when todo is empty
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 15:54:54 UTC 2024 - 4.3K bytes - Viewed (0) -
src/runtime/traceexp.go
// Experimental events for ExperimentAllocFree. // Experimental heap span events. IDs map reversibly to base addresses. traceEvSpan // heap span exists [timestamp, id, npages, type/class] traceEvSpanAlloc // heap span alloc [timestamp, id, npages, type/class] traceEvSpanFree // heap span free [timestamp, id] // Experimental heap object events. IDs map reversibly to addresses. traceEvHeapObject // heap object exists [timestamp, id, type]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 2.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/format.go
// Qualify the package unless it's the package being type-checked. if pkg != check.pkg { if check.pkgPathMap == nil { check.pkgPathMap = make(map[string]map[string]bool) check.seenPkgMap = make(map[*Package]bool) check.markImports(check.pkg) } // If the same package name was used by multiple packages, display the full path. if len(check.pkgPathMap[pkg.name]) > 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 3.5K bytes - Viewed (0) -
src/mime/type.go
"sync" ) var ( mimeTypes sync.Map // map[string]string; ".Z" => "application/x-compress" mimeTypesLower sync.Map // map[string]string; ".z" => "application/x-compress" // extensions maps from MIME type to list of lowercase file // extensions: "image/jpeg" => [".jpg", ".jpeg"] extensionsMu sync.Mutex // Guards stores (but not loads) on extensions. extensions sync.Map // map[string][]string; slice values are append-only. )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5K bytes - Viewed (0) -
src/go/types/objset.go
// object name. package types // An objset is a set of objects identified by their unique id. // The zero value for objset is a ready-to-use empty objset. type objset map[string]Object // initialized lazily // insert attempts to insert an object obj into objset s. // If s already contains an alternative object alt with // the same name, insert leaves s unchanged and returns alt.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/testinggoroutine/util.go
func localFunctionDecls(info *types.Info, files []*ast.File) func(*types.Func) *ast.FuncDecl { var fnDecls map[*types.Func]*ast.FuncDecl // computed lazily return func(f *types.Func) *ast.FuncDecl { if f != nil && fnDecls == nil { fnDecls = make(map[*types.Func]*ast.FuncDecl) for _, file := range files { for _, decl := range file.Decls { if fnDecl, ok := decl.(*ast.FuncDecl); ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 2.4K bytes - Viewed (0) -
src/internal/fmtsort/sort.go
// that are valid map keys. package fmtsort import ( "cmp" "reflect" "slices" ) // Note: Throughout this package we avoid calling reflect.Value.Interface as // it is not always legal to do so and it's easier to avoid the issue than to face it. // SortedMap is a slice of KeyValue pairs that simplifies sorting // and iterating over map entries. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 19:31:45 UTC 2024 - 4.9K bytes - Viewed (0) -
src/internal/trace/base.go
type evTable struct { freq frequency strings dataTable[stringID, string] stacks dataTable[stackID, stack] pcs map[uint64]frame // extraStrings are strings that get generated during // parsing but haven't come directly from the trace, so // they don't appear in strings. extraStrings []string extraStringIDs map[string]extraStringID nextExtra extraStringID // expData contains extra unparsed data that is accessible
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 6.8K bytes - Viewed (0) -
src/runtime/pprof/label.go
parentLabels := labelValue(ctx) childLabels := make(labelMap, len(parentLabels)) // TODO(matloob): replace the map implementation with something // more efficient so creating a child context WithLabels doesn't need // to clone the map. for k, v := range parentLabels { childLabels[k] = v } for _, label := range labels.list { childLabels[label.key] = label.value }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 3K bytes - Viewed (0)