- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 2,677 for map1 (0.04 sec)
-
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/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) -
src/cmd/compile/internal/types2/map.go
package types2 // 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} } // Key returns the key type of map m. func (m *Map) Key() Type { return m.key } // Elem returns the element type of map m. func (m *Map) Elem() Type { return m.elem }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 01 22:17:50 UTC 2021 - 659 bytes - Viewed (0) -
src/internal/types/testdata/check/map0.go
key K val V left, right *node[K, V] } // New returns a new map. func New[K, V any](compare func(K, K) int) *Map[K, V] { return &Map[K, V]{compare: compare} } // find looks up key in the map, and returns either a pointer // to the node holding key, or a pointer to the location where // such a node would go. func (m *Map[K, V]) find(key K) **node[K, V] { pn := &m.root for *pn != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 2.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/map.go
// Annex #29, "Unicode Text Segmentation." For each word boundary, find the // first cased character F following the word boundary. If F exists, map F to // Titlecase_Mapping(F); then map all characters C between F and the following // word boundary to Lowercase_Mapping(C). func (t *titleCaser) Transform(dst, src []byte, atEOF bool) (nDst, nSrc int, err error) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 22.7K 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)