- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 274 for pmap (0.06 sec)
-
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/compile/internal/syntax/testdata/map.go
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: Wed Mar 30 18:02:18 UTC 2022 - 2.8K bytes - Viewed (0) -
src/go/parser/testdata/map.go2
package orderedmap import "chans" // Map is an ordered map. type Map[K, V any] struct { root *node[K, V] compare func(K, K) int } // node is the type of a node in the binary tree. type node[K, V any] struct { 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] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 24 19:44:06 UTC 2020 - 2.6K bytes - Viewed (0) -
src/internal/abi/map.go
// Copyright 2023 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 abi // Map constants common to several packages // runtime/runtime-gdb.py:MapTypePrinter contains its own copy const ( // Maximum number of key/elem pairs a bucket can hold. MapBucketCountBits = 3 // log2 of number of elements in a bucket. MapBucketCount = 1 << MapBucketCountBits
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 20:09:01 UTC 2024 - 719 bytes - Viewed (0) -
test/typeparam/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 ( "fmt" "reflect" "strconv" ) // Map calls the function f on every element of the slice s, // returning a new slice of the results. func mapper[F, T any](s []F, f func(F) T) []T { r := make([]T, 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 Mar 01 19:45:34 UTC 2022 - 885 bytes - Viewed (0) -
pkg/typemap/map.go
import ( "reflect" "istio.io/istio/pkg/ptr" ) // TypeMap provides a map that holds a map of Type -> Value. There can be only a single value per type. // The value stored for a type must be of the same type as the key. type TypeMap struct { inner map[reflect.Type]any } func NewTypeMap() TypeMap { return TypeMap{make(map[reflect.Type]any)} } func Set[T any](t TypeMap, v T) {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Apr 17 16:38:40 UTC 2024 - 1.2K 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) -
pilot/pkg/model/endpointshards.go
// Shardz returns a full deep copy of the global map of shards. This should be used only for testing // and debugging, as the cloning is expensive. func (e *EndpointIndex) Shardz() map[string]map[string]*EndpointShards { e.mu.RLock() defer e.mu.RUnlock() out := make(map[string]map[string]*EndpointShards, len(e.shardsBySvc)) for svcKey, v := range e.shardsBySvc { out[svcKey] = make(map[string]*EndpointShards, len(v))
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Jun 14 04:34:37 UTC 2024 - 15.6K bytes - Viewed (0) -
cni/pkg/install/testdata/invalid-map.conflist
Pengyuan Bian <******@****.***> 1625172474 -0700
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 01 20:47:54 UTC 2021 - 3 bytes - Viewed (0) -
src/test/java/org/codelibs/core/collection/CaseInsensitiveMapTest.java
map.putAll(m); assertThat(map.get("THREE"), is("3")); assertThat(map.get("FOUR"), is("4")); assertThat(map.size(), is(4)); } /** * @throws Exception */ @Test public void testPerformance() throws Exception { for (int j = 0; j < 3; ++j) { final int num = 100000; final Map<String, String> hmap = new HashMap<String, String>();
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 4K bytes - Viewed (0)