- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 507 for Map (0.02 sec)
-
src/internal/trace/traceviewer/pprof.go
Period: 1, SampleType: []*profile.ValueType{ {Type: "contentions", Unit: "count"}, {Type: "delay", Unit: "nanoseconds"}, }, } locs := make(map[uint64]*profile.Location) funcs := make(map[string]*profile.Function) for _, rec := range prof { var sloc []*profile.Location for _, frame := range rec.Stack { loc := locs[frame.PC] if loc == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 21:28:02 UTC 2023 - 4K bytes - Viewed (0) -
src/internal/types/testdata/spec/comparisons.go
_ = i /* ERROR "operator < not defined on interface" */ < i _ = m /* ERROR "operator < not defined on map" */ < m _ = c /* ERROR "operator < not defined on chan" */ < c } func _[ B int, A [10]func(), L []byte, S struct{ f []byte }, P *S, F func(), I interface{}, J comparable, M map[string]int, C chan int, ]( b B, a A, l L, s S, p P, f F, i I, j J, m M,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:27 UTC 2023 - 3K bytes - Viewed (0) -
src/internal/types/testdata/check/slices.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Package slices implements various slice algorithms. package slices // Map turns a []T1 to a []T2 using a mapping function. func Map[T1, T2 any](s []T1, f func(T1) T2) []T2 { r := make([]T2, len(s)) for i, v := range s { r[i] = f(v) } return r }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 1.5K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
need := makeAddrRange(chunksBase+needMin*scSize, chunksBase+needMax*scSize) // Subtract any overlap from rounding. We can't re-map memory because // it'll be zeroed. need = need.subtract(have) // If we've got something to map, map it, and update the slice bounds. if need.size() != 0 { sysMap(unsafe.Pointer(need.base.addr()), need.size(), sysStat)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
src/go/types/gccgosizes.go
// license that can be found in the LICENSE file. // This is a copy of the file generated during the gccgo build process. // Last update 2019-01-22. package types var gccgoArchSizes = map[string]*StdSizes{ "386": {4, 4}, "alpha": {8, 8}, "amd64": {8, 8}, "amd64p32": {4, 8}, "arm": {4, 8}, "armbe": {4, 8}, "arm64": {8, 8}, "arm64be": {8, 8},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 1.1K bytes - Viewed (0) -
src/runtime/pprof/proto_other.go
// when emitting locations. func (b *profileBuilder) readMapping() { data, _ := os.ReadFile("/proc/self/maps") parseProcSelfMaps(data, b.addMapping) if len(b.mem) == 0 { // pprof expects a map entry, so fake one. b.addMappingEntry(0, 0, 0, "", "", true) // TODO(hyangah): make addMapping return *memMap or // take a memMap struct, and get rid of addMappingEntry // that takes a bunch of positional arguments. }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 03 16:07:59 UTC 2023 - 928 bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsemap.go
// in turn, from Briggs and Torczon type sparseEntry struct { key ID val int32 } type sparseMap struct { dense []sparseEntry sparse []int32 } // newSparseMap returns a sparseMap that can map // integers between 0 and n-1 to int32s. func newSparseMap(n int) *sparseMap { return &sparseMap{dense: nil, sparse: make([]int32, n)} } func (s *sparseMap) cap() int { return len(s.sparse) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:06 UTC 2022 - 1.9K bytes - Viewed (0) -
src/runtime/cgo/handle.go
func (h Handle) Delete() { _, ok := handles.LoadAndDelete(uintptr(h)) if !ok { panic("runtime/cgo: misuse of an invalid Handle") } } var ( handles = sync.Map{} // map[Handle]interface{} handleIdx atomic.Uintptr
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 16:59:11 UTC 2023 - 3.6K bytes - Viewed (0) -
src/go/types/mono.go
// // For example, given: // // func f[A, B any]() { // type T int // f[T, map[A]B]() // } // // we construct vertices representing types A, B, and T. Because of // declaration "type T int", we construct edges T<-A and T<-B with // weight 1; and because of instantiation "f[T, map[A]B]" we construct // edges A<-T with weight 0, and B<-A and B<-B with weight 1. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
test/fixedbugs/issue59404.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package p type Interface interface { MonitoredResource() (resType string, labels map[string]string) Done() } func Autodetect() Interface { return func() Interface { Do(func() { var ad, gd Interface go func() { defer gd.Done() ad = aad() }() go func() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 07 15:07:18 UTC 2023 - 935 bytes - Viewed (0)