Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 165 for Storep (0.13 sec)

  1. common-protos/k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto

      // More info: https://kubernetes.io/docs/concepts/overview/working-with-objects/labels
      // +optional
      map<string, string> labels = 11;
    
      // Annotations is an unstructured key value map stored with a resource that may be
      // set by external tools to store and retrieve arbitrary metadata. They are not
      // queryable and should be preserved when modifying objects.
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 53.3K bytes
    - Viewed (0)
  2. staging/src/k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto

      // More info: https://kubernetes.io/docs/concepts/overview/working-with-objects/labels
      // +optional
      map<string, string> labels = 11;
    
      // Annotations is an unstructured key value map stored with a resource that may be
      // set by external tools to store and retrieve arbitrary metadata. They are not
      // queryable and should be preserved when modifying objects.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Mar 28 15:34:11 UTC 2024
    - 53.7K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/lite/transforms/lower_static_tensor_list.cc

    // function.
    llvm::SmallSet<int, 4> GetResizedTensorListIndexes(
        func::FuncOp func, const llvm::SmallSet<int, 4> &tensor_list_args) {
      // `indexes` stores the argument index of tensorlists which size may get
      // updated in the function.
      llvm::SmallSet<int, 4> indexes;
      for (BlockArgument &arg : func.getArguments()) {
        if (tensor_list_args.contains(arg.getArgNumber())) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Jun 11 20:00:43 UTC 2024
    - 70.7K bytes
    - Viewed (0)
  4. pkg/controller/replicaset/replica_set_test.go

    		},
    		Status: v1.PodStatus{Phase: status, Conditions: conditions},
    	}
    }
    
    // create count pods with the given phase for the given ReplicaSet (same selectors and namespace), and add them to the store.
    func newPodList(store cache.Store, count int, status v1.PodPhase, labelMap map[string]string, rs *apps.ReplicaSet, name string) *v1.PodList {
    	pods := []v1.Pod{}
    	var trueVar = true
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 69.2K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/ssa/_gen/AMD64.rules

    // Lowering stores
    (Store {t} ptr val mem) && t.Size() == 8 &&  t.IsFloat() => (MOVSDstore ptr val mem)
    (Store {t} ptr val mem) && t.Size() == 4 &&  t.IsFloat() => (MOVSSstore ptr val mem)
    (Store {t} ptr val mem) && t.Size() == 8 && !t.IsFloat() => (MOVQstore ptr val mem)
    (Store {t} ptr val mem) && t.Size() == 4 && !t.IsFloat() => (MOVLstore ptr val mem)
    (Store {t} ptr val mem) && t.Size() == 2 => (MOVWstore ptr val mem)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 12 19:38:41 UTC 2024
    - 93.9K bytes
    - Viewed (0)
  6. staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher.go

    	// and metrics.
    	GroupResource schema.GroupResource
    
    	// The Cache will be caching objects of a given Type and assumes that they
    	// are all stored under ResourcePrefix directory in the underlying database.
    	ResourcePrefix string
    
    	// KeyFunc is used to get a key in the underlying storage for a given object.
    	KeyFunc func(runtime.Object) (string, error)
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 12 10:12:02 UTC 2024
    - 51.8K bytes
    - Viewed (0)
  7. src/cmd/link/internal/ld/dwarf.go

    }
    
    var dwtypes dwarf.DWDie
    
    // newattr attaches a new attribute to the specified DIE.
    //
    // FIXME: at the moment attributes are stored in a linked list in a
    // fairly space-inefficient way -- it might be better to instead look
    // up all attrs in a single large table, then store indices into the
    // table in the DIE. This would allow us to common up storage for
    // attributes that are shared by many DIEs (ex: byte size of N).
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 16:25:18 UTC 2024
    - 72.4K bytes
    - Viewed (0)
  8. pkg/scheduler/framework/plugins/dynamicresources/dynamicresources.go

    	if err := pl.foreachPodResourceClaim(pod, func(_ string, claim *resourcev1alpha2.ResourceClaim) {
    		// We store the pointer as returned by the lister. The
    		// assumption is that if a claim gets modified while our code
    		// runs, the cache will store a new pointer, not mutate the
    		// existing object that we point to here.
    		claims = append(claims, claim)
    	}); err != nil {
    		return nil, err
    	}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu May 30 15:22:37 UTC 2024
    - 75.9K bytes
    - Viewed (0)
  9. src/cmd/vendor/golang.org/x/sys/windows/syscall_windows.go

    //sys	CertOpenSystemStore(hprov Handle, name *uint16) (store Handle, err error) = crypt32.CertOpenSystemStoreW
    //sys	CertOpenStore(storeProvider uintptr, msgAndCertEncodingType uint32, cryptProv uintptr, flags uint32, para uintptr) (handle Handle, err error) = crypt32.CertOpenStore
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 05 22:18:42 UTC 2024
    - 82.8K bytes
    - Viewed (0)
  10. pkg/scheduler/internal/queue/scheduling_queue.go

    		unschedulableRecorder: unschedulableRecorder,
    		gatedRecorder:         gatedRecorder,
    	}
    }
    
    // nominator is a structure that stores pods nominated to run on nodes.
    // It exists because nominatedNodeName of pod objects stored in the structure
    // may be different than what scheduler has here. We should be able to find pods
    // by their UID and update/delete them.
    type nominator struct {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 12 13:26:09 UTC 2024
    - 61.4K bytes
    - Viewed (0)
Back to top