Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 887 for priority1 (0.57 sec)

  1. maven-api-impl/src/main/java/org/apache/maven/internal/impl/DefaultMessageBuilderFactory.java

    import org.apache.maven.api.di.Inject;
    import org.apache.maven.api.di.Named;
    import org.apache.maven.api.di.Priority;
    import org.apache.maven.api.di.Singleton;
    import org.apache.maven.api.services.MessageBuilder;
    import org.apache.maven.api.services.MessageBuilderFactory;
    
    @Experimental
    @Named
    @Singleton
    @Priority(-1)
    public class DefaultMessageBuilderFactory implements MessageBuilderFactory {
    
        @Inject
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Mon Mar 25 10:50:01 UTC 2024
    - 1.8K bytes
    - Viewed (0)
  2. docs/bucket/replication/setup_3site_replication.sh

    	--replicate "existing-objects,delete,delete-marker,replica-metadata-sync" --priority 2
    sleep 1
    
    echo "adding replication rule for c -> a : ${remote_arn}"
    ./mc replicate add sitec/bucket/ \
    	--remote-bucket http://minio:minio123@127.0.0.1:9001/bucket \
    	--replicate "existing-objects,delete,delete-marker,replica-metadata-sync" --priority 2
    sleep 1
    
    echo "adding replication rule for b -> c : ${remote_arn}"
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon May 27 19:17:46 UTC 2024
    - 10.2K bytes
    - Viewed (0)
  3. pkg/scheduler/framework/plugins/queuesort/priority_sort.go

    // PrioritySort is a plugin that implements Priority based sorting.
    type PrioritySort struct{}
    
    var _ framework.QueueSortPlugin = &PrioritySort{}
    
    // Name returns name of the plugin.
    func (pl *PrioritySort) Name() string {
    	return Name
    }
    
    // Less is the function used by the activeQ heap algorithm to sort pods.
    // It sorts pods based on their priority. When priorities are equal, it uses
    // PodQueueInfo.timestamp.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Sep 20 09:49:54 UTC 2023
    - 1.7K bytes
    - Viewed (0)
  4. pkg/scheduler/internal/queue/testing.go

    	"k8s.io/kubernetes/pkg/scheduler/framework"
    )
    
    // NewTestQueue creates a priority queue with an empty informer factory.
    func NewTestQueue(ctx context.Context, lessFn framework.LessFunc, opts ...Option) *PriorityQueue {
    	return NewTestQueueWithObjects(ctx, lessFn, nil, opts...)
    }
    
    // NewTestQueueWithObjects creates a priority queue with an informer factory
    // populated with the provided objects.
    func NewTestQueueWithObjects(
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Feb 10 00:53:58 UTC 2022
    - 1.7K bytes
    - Viewed (0)
  5. staging/src/k8s.io/apiserver/pkg/server/options/feature.go

    		"Use an unprotected (no authn/authz) unix-domain socket for profiling with the given path")
    	fs.BoolVar(&o.EnablePriorityAndFairness, "enable-priority-and-fairness", o.EnablePriorityAndFairness, ""+
    		"If true, replace the max-in-flight handler with an enhanced one that queues and dispatches with priority and fairness")
    }
    
    func (o *FeatureOptions) ApplyTo(c *server.Config, clientset kubernetes.Interface, informers informers.SharedInformerFactory) error {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Apr 22 18:51:27 UTC 2024
    - 3K bytes
    - Viewed (0)
  6. pkg/config/analysis/analyzers/testdata/envoy-filter-replace-operation.yaml

    # If the patch operation is REPLACE but priority is set, then the analyzer will not do anything
    # If the patch operation is REPLACE but the applyTo is not HTTP_FILTER or NETWORK_FILTER, then an error will occur
    apiVersion: networking.istio.io/v1alpha3
    kind: EnvoyFilter
    metadata:
      name: test-replace-1
      namespace: bookinfo
    spec:
      workloadSelector:
        labels:
          app: reviews1
      priority: 10
      configPatches:
      - applyTo: CLUSTER
        match:
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Tue May 31 19:38:42 UTC 2022
    - 4.9K bytes
    - Viewed (0)
  7. cmd/kubelet/app/init_windows_test.go

    		description           string
    		priorityClassName     string
    		expectedPriorityValue uint32
    	}{
    		{
    			description:           "Invalid Priority Class",
    			priorityClassName:     "myPriorityClass",
    			expectedPriorityValue: 0,
    		},
    		{
    			description:           "Valid Priority Class",
    			priorityClassName:     "IDLE_PRIORITY_CLASS",
    			expectedPriorityValue: uint32(64),
    		},
    	}
    	for _, test := range testCases {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Nov 02 19:48:59 UTC 2020
    - 1.2K bytes
    - Viewed (0)
  8. staging/src/k8s.io/apiextensions-apiserver/test/integration/table_test.go

    						{Name: "Gamma", Type: "integer", Description: "a column with wrongly typed values", JSONPath: ".spec.gamma"},
    						{Name: "Epsilon", Type: "string", Description: "an array of integers as string", JSONPath: ".spec.epsilon"},
    						{Name: "Zeta", Type: "integer", Description: "the zeta field", Format: "int64", Priority: 42, JSONPath: ".spec.zeta"},
    					},
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Mar 02 19:34:41 UTC 2021
    - 18.9K bytes
    - Viewed (0)
  9. schema/index_test.go

    	// Composite Index: Nested structure.
    	Data1A string `gorm:"index:,composite:comp_id1"`
    	CompIdxLevel1C
    
    	// Composite Index: Unique and priority.
    	Data2A string `gorm:"index:,unique,composite:comp_id2,priority:2"`
    	CompIdxLevel2C
    }
    
    type CompIdxLevel1C struct {
    	CompIdxLevel1B
    	Data1C string `gorm:"index:,composite:comp_id1"`
    }
    
    type CompIdxLevel1B struct {
    Registered: Wed Jun 12 16:27:09 UTC 2024
    - Last Modified: Sun Feb 04 07:49:19 UTC 2024
    - 8K bytes
    - Viewed (0)
  10. src/container/heap/heap.go

    //
    // The minimum element in the tree is the root, at index 0.
    //
    // A heap is a common way to implement a priority queue. To build a priority
    // queue, implement the Heap interface with the (negative) priority as the
    // ordering for the Less method, so Push adds items while Pop removes the
    // highest-priority item from the queue. The Examples include such an
    // implementation; the file example_pq_test.go has the complete source.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 12 14:39:10 UTC 2023
    - 3.3K bytes
    - Viewed (0)
Back to top