- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 305 for omap (0.04 sec)
-
src/runtime/map_fast64.go
) func mapaccess1_fast64(t *maptype, h *hmap, key uint64) unsafe.Pointer { if raceenabled && h != nil { callerpc := getcallerpc() racereadpc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(mapaccess1_fast64)) } if h == nil || h.count == 0 { return unsafe.Pointer(&zeroVal[0]) } if h.flags&hashWriting != 0 { fatal("concurrent map read and map write") } var b *bmap if h.B == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/map_fast32.go
) func mapaccess1_fast32(t *maptype, h *hmap, key uint32) unsafe.Pointer { if raceenabled && h != nil { callerpc := getcallerpc() racereadpc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(mapaccess1_fast32)) } if h == nil || h.count == 0 { return unsafe.Pointer(&zeroVal[0]) } if h.flags&hashWriting != 0 { fatal("concurrent map read and map write") } var b *bmap if h.B == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
pkg/controller/util/selectors/bimultimap_test.go
func unorderedEqual(as, bs []Key) bool { if len(as) != len(bs) { return false } aMap := make(map[Key]int) for _, a := range as { aMap[a]++ } bMap := make(map[Key]int) for _, b := range bs { bMap[b]++ } if len(aMap) != len(bMap) { return false } for a, count := range aMap { if bMap[a] != count { return false } } return true
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Dec 13 01:56:36 UTC 2022 - 16.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/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/cmd/vendor/golang.org/x/telemetry/internal/mmap/mmap.go
// license that can be found in the LICENSE file. // This package is a lightly modified version of the mmap code // in github.com/google/codesearch/index. // The mmap package provides an abstraction for memory mapping files // on different platforms. package mmap import ( "os" ) // The backing file is never closed, so Data // remains valid for the lifetime of the process.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 30 21:40:49 UTC 2024 - 1002 bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/universe.go
) var builtinFuncs = [...]struct { name string op ir.Op }{ {"append", ir.OAPPEND}, {"cap", ir.OCAP}, {"clear", ir.OCLEAR}, {"close", ir.OCLOSE}, {"complex", ir.OCOMPLEX}, {"copy", ir.OCOPY}, {"delete", ir.ODELETE}, {"imag", ir.OIMAG}, {"len", ir.OLEN}, {"make", ir.OMAKE}, {"max", ir.OMAX}, {"min", ir.OMIN}, {"new", ir.ONEW}, {"panic", ir.OPANIC}, {"print", ir.OPRINT},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 05 15:20:28 UTC 2023 - 4.7K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
t := n.Type() hmapType := reflectdata.MapType() hint := n.Len // var h *hmap var h ir.Node if n.Esc() == ir.EscNone { // Allocate hmap on stack. // var hv hmap // h = &hv h = stackTempAddr(init, hmapType) // Allocate one bucket pointed to by hmap.buckets on stack if hint // is not larger than BUCKETSIZE. In case hint is larger than
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/types/typeutil/map.go
// == cannot be used to check for equivalence, and thus we cannot // simply use a Go map. // // Just as with map[K]V, a nil *Map is a valid empty map. // // Not thread-safe. type Map struct { hasher Hasher // shared by many Maps table map[uint32][]entry // maps hash to bucket; entry.key==nil means unused length int // number of map entries } // entry is an entry (key/value association) in a hash bucket.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13.9K bytes - Viewed (0) -
pilot/pkg/serviceregistry/util/workloadinstances/map.go
) // MultiValueMap represents a map where each key might be associated with // multiple values. type MultiValueMap map[string]sets.String // Insert adds given (key, value) pair into the map. func (m MultiValueMap) Insert(key, value string) MultiValueMap { sets.InsertOrNew(m, key, value) return m } // Delete removes given (key, value) pair out of the map.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Feb 08 02:49:42 UTC 2023 - 1.1K bytes - Viewed (0)