Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 50 for setIws (0.16 sec)

  1. android/guava/src/com/google/common/collect/Sets.java

        return CartesianSet.create(sets);
      }
    
      /**
       * Returns every possible list that can be formed by choosing one element from each of the given
       * sets in order; the "n-ary <a href="http://en.wikipedia.org/wiki/Cartesian_product">Cartesian
       * product</a>" of the sets. For example:
       *
       * <pre>{@code
       * Sets.cartesianProduct(
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Sun Jun 02 13:36:19 UTC 2024
    - 77.3K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/collect/SetsTest.java

        checkHashCode(Sets.cartesianProduct(set(num), mt));
        checkHashCode(Sets.cartesianProduct(set(num), set(1)));
        checkHashCode(Sets.cartesianProduct(set(1), set(2, num)));
        checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1)));
        checkHashCode(Sets.cartesianProduct(set(1, num), set(2, num - 1), set(3, num + 1)));
    
        // a bigger one
        checkHashCode(
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Fri May 17 15:27:58 UTC 2024
    - 49.2K bytes
    - Viewed (0)
  3. pkg/apis/admissionregistration/validation/validation.go

    type preexistingExpressions struct {
    	matchConditionExpressions        sets.Set[string]
    	validationExpressions            sets.Set[string]
    	validationMessageExpressions     sets.Set[string]
    	auditAnnotationValuesExpressions sets.Set[string]
    }
    
    func newPreexistingExpressions() preexistingExpressions {
    	return preexistingExpressions{
    		matchConditionExpressions:        sets.New[string](),
    		validationExpressions:            sets.New[string](),
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri May 10 22:07:40 UTC 2024
    - 56.6K bytes
    - Viewed (0)
  4. pkg/scheduler/framework/runtime/framework.go

    		o.componentConfigVersion = componentConfigVersion
    	}
    }
    
    // WithClientSet sets clientSet for the scheduling frameworkImpl.
    func WithClientSet(clientSet clientset.Interface) Option {
    	return func(o *frameworkOptions) {
    		o.clientSet = clientSet
    	}
    }
    
    // WithKubeConfig sets kubeConfig for the scheduling frameworkImpl.
    func WithKubeConfig(kubeConfig *restclient.Config) Option {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri May 17 09:07:27 UTC 2024
    - 60.9K bytes
    - Viewed (0)
  5. pkg/proxy/nftables/proxier.go

    		Name: serviceIPsMap,
    	})
    	tx.Flush(&knftables.Map{
    		Name: serviceNodePortsMap,
    	})
    
    	// Accumulate service/endpoint chains and affinity sets to keep.
    	activeChains := sets.New[string]()
    	activeAffinitySets := sets.New[string]()
    
    	// Compute total number of endpoint chains across all services
    	// to get a sense of how big the cluster is.
    	totalEndpoints := 0
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat Jun 08 13:48:54 UTC 2024
    - 55.5K bytes
    - Viewed (0)
  6. staging/src/k8s.io/apiextensions-apiserver/pkg/apis/apiextensions/validation/validation.go

    	"k8s.io/apimachinery/pkg/util/sets"
    	utilvalidation "k8s.io/apimachinery/pkg/util/validation"
    	"k8s.io/apimachinery/pkg/util/validation/field"
    	celconfig "k8s.io/apiserver/pkg/apis/cel"
    	apiservercel "k8s.io/apiserver/pkg/cel"
    	"k8s.io/apiserver/pkg/cel/environment"
    	"k8s.io/apiserver/pkg/util/webhook"
    )
    
    var (
    	printerColumnDatatypes                = sets.NewString("integer", "number", "string", "boolean", "date")
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri May 10 22:07:40 UTC 2024
    - 82.6K bytes
    - Viewed (0)
  7. pkg/kubelet/pod_workers_test.go

    		}
    	}
    }
    
    func newUIDSet(uids ...types.UID) sets.Set[string] {
    	set := sets.New[string]()
    	for _, uid := range uids {
    		set.Insert(string(uid))
    	}
    	return set
    }
    
    type terminalPhaseSync struct {
    	lock     sync.Mutex
    	fn       syncPodFnType
    	terminal sets.Set[string]
    }
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Jun 04 06:25:43 UTC 2024
    - 75.6K bytes
    - Viewed (0)
  8. plugin/pkg/admission/resourcequota/admission_test.go

    		t.Errorf("Unexpected error: %v", err)
    	}
    	if len(kubeClient.Actions()) == 0 {
    		t.Errorf("Expected a client action")
    	}
    
    	expectedActionSet := sets.NewString(
    		strings.Join([]string{"update", "resourcequotas", "status"}, "-"),
    	)
    	actionSet := sets.NewString()
    	for _, action := range kubeClient.Actions() {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Apr 29 21:28:42 UTC 2024
    - 84.1K bytes
    - Viewed (0)
  9. plugin/pkg/admission/noderestriction/admission_test.go

    		a    map[string]string
    		b    map[string]string
    		want sets.String
    	}{
    		{
    			name: "empty",
    			a:    nil,
    			b:    nil,
    			want: sets.NewString(),
    		},
    		{
    			name: "no change",
    			a:    map[string]string{"x": "1", "y": "2", "z": "3"},
    			b:    map[string]string{"x": "1", "y": "2", "z": "3"},
    			want: sets.NewString(),
    		},
    		{
    			name: "added",
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Apr 24 18:25:29 UTC 2024
    - 73.2K bytes
    - Viewed (0)
  10. pkg/controller/job/job_controller.go

    	return patchBytes
    }
    
    type uncountedTerminatedPods struct {
    	succeeded sets.Set[string]
    	failed    sets.Set[string]
    }
    
    func newUncountedTerminatedPods(in batch.UncountedTerminatedPods) *uncountedTerminatedPods {
    	obj := uncountedTerminatedPods{
    		succeeded: make(sets.Set[string], len(in.Succeeded)),
    		failed:    make(sets.Set[string], len(in.Failed)),
    	}
    	for _, v := range in.Succeeded {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Jun 10 23:56:37 UTC 2024
    - 77.6K bytes
    - Viewed (0)
Back to top