- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 305 for omap (0.05 sec)
-
src/runtime/pprof/map.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package pprof import "unsafe" // A profMap is a map from (stack, tag) to mapEntry. // It grows without bound, but that's assumed to be OK. type profMap struct { hash map[uintptr]*profMapEntry all *profMapEntry last *profMapEntry free []profMapEntry freeStk []uintptr }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 05 21:51:02 UTC 2020 - 1.9K bytes - Viewed (0) -
test/abi/map.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package main import "runtime" type T [10]int var m map[*T]int //go:noinline func F() { m = map[*T]int{ K(): V(), // the key temp should be live across call to V } } //go:noinline func V() int { runtime.GC(); runtime.GC(); runtime.GC(); return 123 } //go:noinline
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 20 14:30:03 UTC 2021 - 557 bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/mime.map
Shinsuke Sugaya <******@****.***> 1553287182 +0900
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 5.9K bytes - Viewed (0) -
src/go/types/map.go
// Source: ../../cmd/compile/internal/types2/map.go // Copyright 2011 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package types // A Map represents a map type. type Map struct { key, elem Type } // NewMap returns a new map for the given key and element types. func NewMap(key, elem Type) *Map { return &Map{key: key, elem: elem} }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 781 bytes - Viewed (0) -
pkg/test/framework/config/map.go
package config import ( "fmt" "istio.io/istio/pkg/test/scopes" ) type Map map[string]any func (m Map) Map(key string) Map { nested, ok := m[key] if !ok { return nil } out, ok := nested.(Map) if !ok { return nil } return out } func (m Map) String(key string) string { v, ok := m[key] if !ok || v == nil { return "" } str, ok := v.(string)
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Jul 25 19:30:47 UTC 2022 - 2.2K bytes - Viewed (0) -
src/runtime/testdata/testprog/map.go
} func concurrentMapWrites() { m := map[int]int{} c := make(chan struct{}) go func() { for i := 0; i < 10000; i++ { m[5] = 0 runtime.Gosched() } c <- struct{}{} }() go func() { for i := 0; i < 10000; i++ { m[6] = 0 runtime.Gosched() } c <- struct{}{} }() <-c <-c } func concurrentMapReadWrite() { m := map[int]int{} c := make(chan struct{})
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 16 21:52:44 UTC 2016 - 1.3K bytes - Viewed (0) -
src/sync/map.go
// The zero Map is empty and ready for use. A Map must not be copied after first use. // // In the terminology of [the Go memory model], Map arranges that a write operation // “synchronizes before” any read operation that observes the effect of the write, where // read and write operations are defined as follows. // [Map.Load], [Map.LoadAndDelete], [Map.LoadOrStore], [Map.Swap], [Map.CompareAndSwap], // and [Map.CompareAndDelete] are read operations;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 21:14:51 UTC 2024 - 15.6K bytes - Viewed (0) -
test/map.go
mss := make(map[string]string) mspa := make(map[string][]string) // BUG need an interface map both ways too type T struct { i int64 // can't use string here; struct values are only compared at the top level f float32 } mipT := make(map[int]*T) mpTi := make(map[*T]int) mit := make(map[int]T) // mti := make(map[T] int) type M map[int]int mipM := make(map[int]M) var apT [2 * count]*T
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 06 21:02:55 UTC 2014 - 14.9K bytes - Viewed (0) -
src/cmd/compile/internal/dwarfgen/dwinl.go
// produced by the inliner will wind up in the vmap[0] entry. vmap := make(map[int32][]*dwarf.Var) // Now walk the dwarf vars and partition them based on whether they // were produced by the inliner (dwv.InlIndex > 0) or were original // vars/params from the function (dwv.InlIndex == 0). for _, dwv := range dwVars { vmap[dwv.InlIndex] = append(vmap[dwv.InlIndex], dwv)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:45:07 UTC 2024 - 12.8K bytes - Viewed (0) -
src/cmd/link/internal/ld/outbuf_windows.go
Exitf("resize output file failed: %v", err) } low, high := uint32(filesize), uint32(filesize>>32) fmap, err := syscall.CreateFileMapping(syscall.Handle(out.f.Fd()), nil, syscall.PAGE_READWRITE, high, low, nil) if err != nil { return err } defer syscall.CloseHandle(fmap) ptr, err := syscall.MapViewOfFile(fmap, syscall.FILE_MAP_READ|syscall.FILE_MAP_WRITE, 0, 0, uintptr(filesize)) if err != nil { return err }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 01:59:25 UTC 2022 - 2.3K bytes - Viewed (0)