Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 92 for nodestore (0.2 sec)

  1. pkg/controller/daemon/daemon_controller_test.go

    		if err != nil {
    			t.Fatal(err)
    		}
    		addNodes(manager.nodeStore, 0, 5, nil)
    		addNodes(manager.nodeStore, 5, 5, simpleNodeLabel)
    		addPods(manager.podStore, "node-0", simpleDaemonSetLabel2, ds, 2)
    		addPods(manager.podStore, "node-1", simpleDaemonSetLabel, ds, 3)
    		addPods(manager.podStore, "node-1", simpleDaemonSetLabel2, ds, 1)
    		addPods(manager.podStore, "node-4", simpleDaemonSetLabel, ds, 1)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 111.4K bytes
    - Viewed (0)
  2. pkg/controller/ttl/ttl_controller_test.go

    		},
    	}
    
    	for i, testCase := range testCases {
    		fakeClient := &fake.Clientset{}
    		nodeStore := cache.NewIndexer(cache.MetaNamespaceKeyFunc, cache.Indexers{})
    		nodeStore.Add(testCase.node)
    		ttlController := &Controller{
    			kubeClient:        fakeClient,
    			nodeStore:         listers.NewNodeLister(nodeStore),
    			desiredTTLSeconds: testCase.desiredTTL,
    		}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  3. pkg/controller/daemon/update_test.go

    	if err != nil {
    		t.Fatal(err)
    	}
    
    	// Add five nodes and taint to one node
    	addNodes(manager.nodeStore, 0, 5, nil)
    	taints := []v1.Taint{
    		{Key: "node-role.kubernetes.io/control-plane", Effect: v1.TaintEffectNoSchedule},
    	}
    	node := newNode("node-0", nil)
    	setNodeTaint(node, taints)
    	err = manager.nodeStore.Update(node)
    	if err != nil {
    		t.Fatal(err)
    	}
    
    	// Create DaemonSet with toleration
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat Feb 10 21:10:35 UTC 2024
    - 28.9K bytes
    - Viewed (0)
  4. pkg/controller/ttl/ttl_controller.go

    	"k8s.io/kubernetes/pkg/controller"
    
    	"k8s.io/klog/v2"
    )
    
    // Controller sets ttl annotations on nodes, based on cluster size.
    type Controller struct {
    	kubeClient clientset.Interface
    
    	// nodeStore is a local cache of nodes.
    	nodeStore listers.NodeLister
    
    	// Nodes that need to be synced.
    	queue workqueue.TypedRateLimitingInterface[string]
    
    	// Returns true if all underlying informers are synced.
    	hasSynced func() bool
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  5. pkg/registry/core/rest/storage_core.go

    	if err != nil {
    		return genericapiserver.APIGroupInfo{}, err
    	}
    
    	nodeStorage, err := nodestore.NewStorage(restOptionsGetter, p.Proxy.KubeletClientConfig, p.Proxy.Transport)
    	if err != nil {
    		return genericapiserver.APIGroupInfo{}, err
    	}
    
    	podStorage, err := podstore.NewStorage(
    		restOptionsGetter,
    		nodeStorage.KubeletConnectionInfo,
    		p.Proxy.Transport,
    		podDisruptionClient,
    	)
    	if err != nil {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Oct 31 21:05:05 UTC 2023
    - 19.1K bytes
    - Viewed (0)
  6. pkg/controller/endpointslice/endpointslice_controller_test.go

    	}
    	node2 := &v1.Node{
    		ObjectMeta: metav1.ObjectMeta{Name: "node-2"},
    		Status:     nodeReadyStatus,
    	}
    	logger, _ := ktesting.NewTestContext(t)
    	esController.nodeStore.Add(node1)
    	esController.nodeStore.Add(node2)
    	esController.addNode()
    	esController.addNode()
    	assert.Equal(t, 1, esController.topologyQueue.Len())
    	esController.processNextTopologyWorkItem(logger)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Jun 04 08:33:32 UTC 2024
    - 65.5K bytes
    - Viewed (0)
  7. platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java

    import java.util.Objects;
    import java.util.Set;
    import java.util.stream.Collectors;
    
    /**
     * Represents a node in the dependency graph.
     */
    public class NodeState implements DependencyGraphNode {
        private static final Logger LOGGER = LoggerFactory.getLogger(NodeState.class);
        private final Long nodeId;
        private final ComponentState component;
        private final List<EdgeState> incomingEdges = new ArrayList<>();
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Fri Jun 07 14:19:34 UTC 2024
    - 58.9K bytes
    - Viewed (0)
  8. pkg/scheduler/framework/plugins/noderesources/requested_to_capacity_ratio_test.go

    					t.Errorf("Score is expected to return success, but didn't. Got status: %v", status)
    				}
    				gotList = append(gotList, framework.NodeScore{Name: n.Name, Score: score})
    			}
    
    			if diff := cmp.Diff(test.expectedScores, gotList); diff != "" {
    				t.Errorf("Unexpected nodescore list (-want,+got):\n%s", diff)
    			}
    		})
    	}
    }
    
    func TestResourceBinPackingMultipleExtended(t *testing.T) {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Dec 15 03:30:06 UTC 2023
    - 21.2K bytes
    - Viewed (0)
  9. pkg/scheduler/framework/plugins/imagelocality/image_locality_test.go

    			pod:          &v1.Pod{Spec: test40250},
    			nodes:        []*v1.Node{makeImageNode("node1", node403002000), makeImageNode("node2", node25010)},
    			expectedList: []framework.NodeScore{{Name: "node1", Score: 0}, {Name: "node2", Score: 5}},
    			name:         "two images spread on two nodes, prefer the larger image one",
    		},
    		{
    			// Pod: gcr.io/40 gcr.io/300
    
    			// Node1
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Feb 19 06:17:57 UTC 2024
    - 10.3K bytes
    - Viewed (0)
  10. pkg/scheduler/framework/plugins/noderesources/least_allocated.go

    	return func(requested, allocable []int64) int64 {
    		var nodeScore, weightSum int64
    		for i := range requested {
    			if allocable[i] == 0 {
    				continue
    			}
    			weight := resources[i].Weight
    			resourceScore := leastRequestedScore(requested[i], allocable[i])
    			nodeScore += resourceScore * weight
    			weightSum += weight
    		}
    		if weightSum == 0 {
    			return 0
    		}
    		return nodeScore / weightSum
    	}
    }
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sun Mar 12 01:50:09 UTC 2023
    - 2K bytes
    - Viewed (0)
Back to top