- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 851 for Storep (0.11 sec)
-
cmd/kubeadm/app/constants/constants.go
KubeadmConfigConfigMap = "kubeadm-config" // ClusterConfigurationConfigMapKey specifies in what ConfigMap key the cluster configuration should be stored ClusterConfigurationConfigMapKey = "ClusterConfiguration" // KubeProxyConfigMap specifies in what ConfigMap in the kube-system namespace the kube-proxy configuration should be stored KubeProxyConfigMap = "kube-proxy"
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Jun 01 03:36:35 UTC 2024 - 32.4K bytes - Viewed (0) -
src/internal/concurrent/hashtriemap.go
if oldEntry == nil { // Easy case: create a new entry and store it. slot.Store(&newEntry.node) } else { // We possibly need to expand the entry already there into one or more new nodes. // // Publish the node last, which will make both oldEntry and newEntry visible. We // don't want readers to be able to observe that oldEntry isn't in the tree. slot.Store(ht.expand(oldEntry, newEntry, hash, hashShift, i)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 16:01:55 UTC 2024 - 11.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
src/encoding/gob/decode.go
v.Set(reflect.New(v.Type().Elem())) } v = v.Elem() } return v } // decBool decodes a uint and stores it as a boolean in value. func decBool(i *decInstr, state *decoderState, value reflect.Value) { value.SetBool(state.decodeUint() != 0) } // decInt8 decodes an integer and stores it as an int8 in value. func decInt8(i *decInstr, state *decoderState, value reflect.Value) { v := state.decodeInt()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 07 19:10:23 UTC 2023 - 40.1K bytes - Viewed (0) -
src/internal/abi/type.go
// Pointers reports whether t contains pointers. func (t *Type) Pointers() bool { return t.PtrBytes != 0 } // IfaceIndir reports whether t is stored indirectly in an interface value. func (t *Type) IfaceIndir() bool { return t.Kind_&KindDirectIface == 0 } // isDirectIface reports whether t is stored directly in an interface value. func (t *Type) IsDirectIface() bool { return t.Kind_&KindDirectIface != 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 17 21:09:59 UTC 2024 - 21.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/cache/DiskLruCache.kt
* bytes in length. * * The cache stores its data in a directory on the filesystem. This directory must be exclusive to * the cache; the cache may delete or overwrite files from its directory. It is an error for * multiple processes to use the same cache directory at the same time. * * This cache limits the number of bytes that it will store on the filesystem. When the number of
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 34.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
// and outputs are stored immediately with OpStore. // // After call expansion, Calls have the same fixed-middle-memory arrangement of inputs, // with the difference that the "middle" is only the register-resident inputs, // and the non-register inputs are instead stored at ABI-defined offsets from SP // (and the stores thread through the memory that is ultimately an input to the call).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0) -
src/crypto/tls/quic.go
// EnableStoreSessionEvent may be set to true to enable the // [QUICStoreSession] event for client connections. // When this event is enabled, sessions are not automatically // stored in the client session cache. // The application should use [QUICConn.StoreSession] to store sessions. EnableStoreSessionEvent bool } // A QUICEventKind is a type of operation on a QUIC connection. type QUICEventKind int const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 17:23:54 UTC 2024 - 15.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/memcombine.go
defer f.retSparseSet(mark) var order []*Value for _, b := range f.Blocks { // Mark all stores which are not last in a store sequence. mark.clear() for _, v := range b.Values { if v.Op == OpStore { mark.add(v.MemoryArg().ID) } } // pick an order for visiting stores such that // later stores come earlier in the ordering. order = order[:0] for _, v := range b.Values {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/schema/schema_v3b.fbs
// example, a 2-D matrix with 2-D blocks, both stored in row-major order // would have traversal_order = (d0, d1, d2, d3). traversal_order:[int]; // For an n-dimensional tensor with a k-dimensional block (0 <= k <= n), // stores how a block dimension in (dn, ..., dn+k-1) maps to the original // tensor dimension in (d0, ..., dn). // It's stored in the order of (dn, ..., dn+k-1).
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 14:28:27 UTC 2024 - 30K bytes - Viewed (0)