- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for keyMap (0.14 sec)
-
pkg/controller/util/selectors/bimultimap.go
// rest. Like calling Delete for all keys not specified. func (m *BiMultimap) KeepOnly(keys []Key) { m.mux.Lock() defer m.mux.Unlock() keyMap := make(map[Key]bool) for _, k := range keys { keyMap[k] = true } for k := range m.labeledObjects { if !keyMap[k] { m.delete(k) } } } // KeepOnlySelectors retains only the specified selecting objects and
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 27 21:41:32 UTC 2023 - 9.6K bytes - Viewed (0) -
internal/logger/reqinfo.go
} } if !updated { // Append to the end of tags list r.tags = append(r.tags, KeyVal{key, val}) } return r } // GetTags - returns the user defined tags func (r *ReqInfo) GetTags() []KeyVal { if r == nil { return nil } r.RLock() defer r.RUnlock() return append(make([]KeyVal, 0, len(r.tags)), r.tags...) } // GetTagsMap - returns the user defined tags in a map structure
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Apr 04 12:04:40 UTC 2024 - 4.4K bytes - Viewed (0) -
pkg/scheduler/testing/workload_prep.go
var labelPairs []keyVal for k, v := range labels { labelPairs = append(labelPairs, keyVal{k: k, v: v}) } zones := 10 // build nodes for i := 0; i < allNodesNum; i++ { node := MakeNode().Name(fmt.Sprintf("node%d", i)).
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 16 13:43:36 UTC 2023 - 2.3K bytes - Viewed (0) -
src/go/parser/testdata/map.go2
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/cmd/compile/internal/syntax/testdata/map.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 30 18:02:18 UTC 2022 - 2.8K bytes - Viewed (0) -
test/typeparam/orderedmapsimp.dir/a.go
// whether they are valid. If not valid, we have reached the end of the map. func (it *Iterator[K, V]) Next() (K, V, bool) { keyval, ok := it.r.Next(context.Background()) if !ok { var zerok K var zerov V return zerok, zerov, false } return keyval.key, keyval.val, true } // Equal reports whether two slices are equal: the same length and all
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 28 21:40:40 UTC 2021 - 5.5K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/testdata/map2.go
// whether they are valid or whether we have reached the end. func (it *Iterator[K, V]) Next() (K, V, bool) { keyval, ok := it.r.Next() if !ok { var zerok K var zerov V return zerok, zerov, false } return keyval.key, keyval.val, true } // chans func chans_Ranger[T any]() (*chans_Sender[T], *chans_Receiver[T])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 01 12:49:49 UTC 2023 - 3.4K bytes - Viewed (0) -
src/internal/types/testdata/check/map1.go
// whether they are valid or whether we have reached the end. func (it *Iterator[K, V]) Next() (K, V, bool) { keyval, ok := it.r.Next() if !ok { var zerok K var zerov V return zerok, zerov, false } return keyval.key, keyval.val, true } // chans func chans_Ranger[T any]() (*chans_Sender[T], *chans_Receiver[T]) { panic(0) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 02:58:32 UTC 2022 - 3.4K bytes - Viewed (0) -
src/internal/types/testdata/check/map0.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 2.8K bytes - Viewed (0) -
test/typeparam/orderedmap.go
// whether they are valid. If not valid, we have reached the end of the map. func (it *_Iterator[K, V]) Next() (K, V, bool) { keyval, ok := it.r.Next(context.Background()) if !ok { var zerok K var zerov V return zerok, zerov, false } return keyval.key, keyval.val, true } func TestMap() { m := _New[[]byte, int](bytes.Compare) if _, found := m.Find([]byte("a")); found {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 7.1K bytes - Viewed (0)