Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for expectedNodes (0.38 sec)

  1. pkg/controller/nodelifecycle/node_lifecycle_controller_test.go

    		}
    		if len(item.fakeNodeHandler.UpdatedNodes) > 0 && !apiequality.Semantic.DeepEqual(item.expectedNodes, item.fakeNodeHandler.UpdatedNodes) {
    			t.Errorf("Case[%d] unexpected nodes: %s", i, cmp.Diff(item.expectedNodes[0], item.fakeNodeHandler.UpdatedNodes[0]))
    		}
    		if len(item.fakeNodeHandler.UpdatedNodeStatuses) > 0 && !apiequality.Semantic.DeepEqual(item.expectedNodes, item.fakeNodeHandler.UpdatedNodeStatuses) {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Feb 26 03:26:45 UTC 2024
    - 119K bytes
    - Viewed (0)
  2. pkg/scheduler/schedule_one_test.go

    		name                  string
    		extenders             []tf.FakeExtender
    		nodes                 []*v1.Node
    		filteredNodesStatuses framework.NodeToStatusMap
    		expectsErr            bool
    		expectedNodes         []*v1.Node
    		expectedStatuses      framework.NodeToStatusMap
    	}{
    		{
    			name: "error",
    			extenders: []tf.FakeExtender{
    				{
    					ExtenderName: "FakeExtender1",
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Jun 04 06:20:55 UTC 2024
    - 128.1K bytes
    - Viewed (0)
  3. pkg/kubelet/kubelet_node_status_test.go

    	}
    
    	// Expect LastHeartbeat updated, other things unchanged.
    	for i, cond := range expectedNode.Status.Conditions {
    		expectedNode.Status.Conditions[i].LastHeartbeatTime = metav1.NewTime(cond.LastHeartbeatTime.Time.Add(time.Minute)).Rfc3339Copy()
    	}
    	assert.True(t, apiequality.Semantic.DeepEqual(expectedNode, updatedNode), "%s", cmp.Diff(expectedNode, updatedNode))
    
    	// Update node status again when nothing is changed (except heartbeat time).
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed May 08 19:23:19 UTC 2024
    - 115.8K bytes
    - Viewed (0)
  4. pkg/scheduler/internal/queue/scheduling_queue_test.go

    	totalNum := 10
    	expectedPods := make([]v1.Pod, 0, totalNum)
    	for i := 0; i < totalNum; i++ {
    		priority := int32(i)
    		p := st.MakePod().Name(fmt.Sprintf("pod%d", i)).Namespace(fmt.Sprintf("ns%d", i)).UID(fmt.Sprintf("upns%d", i)).Priority(priority).Obj()
    		expectedPods = append(expectedPods, *p)
    		// priority is to make pods ordered in the PriorityQueue
    		q.Add(logger, p)
    	}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 12 13:26:09 UTC 2024
    - 146.9K bytes
    - Viewed (0)
  5. tensorflow/compiler/jit/encapsulate_subgraphs_pass_test.cc

          "_cluster", graph_before_encapsulation,
          /*rewrite_subgraph_fn=*/{},
          /*reuse_existing_functions=*/false, &graph, &library));
    
      std::vector<string> expected_nodes = {"cluster1", "cluster2", "mul", "x"};
      EXPECT_EQ(expected_nodes, GraphNodes(*graph));
    
      std::vector<std::pair<string, string>> expected_edges = {
          {"cluster1:0", "cluster2:0"},
          {"cluster1:0", "mul:0"},
          {"cluster2:0", "mul:1"},
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Feb 22 08:47:20 UTC 2024
    - 113.3K bytes
    - Viewed (0)
  6. api/openapi-spec/v3/apis__policy__v1_openapi.json

                "default": 0,
                "description": "Number of pod disruptions that are currently allowed.",
                "format": "int32",
                "type": "integer"
              },
              "expectedPods": {
                "default": 0,
                "description": "total number of pods counted by this disruption budget",
                "format": "int32",
                "type": "integer"
              },
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Mar 08 04:18:56 UTC 2024
    - 159.9K bytes
    - Viewed (0)
Back to top