- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 2,127 for removePod (0.3 sec)
-
subprojects/core/src/main/resources/org/gradle/initialization/removed-types.txt
Anže Sodja <******@****.***> 1701163530 +0100
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Nov 28 09:26:18 UTC 2023 - 1.4K bytes - Viewed (0) -
tests/integration/operator/switch_cr_test.go
scopes.Framework.Infof("checking operator remove command for default revision") removeCmd := []string{ "operator", "remove", "--skip-confirmation", "--revision", "default", } istioCtl.InvokeOrFail(t, removeCmd) retry.UntilSuccessOrFail(t, func() error { // check the revision of operator which should to be removed
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Apr 10 20:33:28 UTC 2024 - 17.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.removeNode(nodeList.get(i))).isTrue(); } assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); // Number of edges remaining is unknown (node's incident edges have been removed). AbstractGraphTest.validateGraph(graph); for (int i = numNodesToRemove; i < NUM_NODES; ++i) { assertThat(graph.removeNode(nodeList.get(i))).isTrue(); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
pkg/scheduler/internal/cache/node_tree.go
nt.tree[zone] = []string{n.Name} } logger.V(2).Info("Added node in listed group to NodeTree", "node", klog.KObj(n), "zone", zone) nt.numNodes++ } // removeNode removes a node from the NodeTree. func (nt *nodeTree) removeNode(logger klog.Logger, n *v1.Node) error { zone := utilnode.GetZoneKey(n) if na, ok := nt.tree[zone]; ok { for i, nodeName := range na { if nodeName == n.Name {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 29 05:26:32 UTC 2023 - 4.5K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableNetwork.java
} @Override @CanIgnoreReturnValue public boolean removeNode(N node) { checkNotNull(node, "node"); NetworkConnections<N, E> connections = nodeConnections.get(node); if (connections == null) { return false; } // Since views are returned, we need to copy the edges that will be removed. // Thus we avoid modifying the underlying view while iterating over it.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
} @Override @CanIgnoreReturnValue public boolean removeNode(N node) { checkNotNull(node, "node"); NetworkConnections<N, E> connections = nodeConnections.get(node); if (connections == null) { return false; } // Since views are returned, we need to copy the edges that will be removed. // Thus we avoid modifying the underlying view while iterating over it.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
* graphs. Instances of this class should be constructed with {@link ValueGraphBuilder}. * * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)}, * which is in O(d_node) where d_node is the degree of {@code node}. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @param <N> Node parameter type
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableValueGraph.java
* graphs. Instances of this class should be constructed with {@link ValueGraphBuilder}. * * <p>Time complexities for mutation methods are all O(1) except for {@code removeNode(N node)}, * which is in O(d_node) where d_node is the degree of {@code node}. * * @author James Sexton * @author Joshua O'Madadhain * @author Omar Darwish * @param <N> Node parameter type
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
pkg/controller/garbagecollector/graph_builder.go
} oldUIDSet.Delete(newUID) } else { added = append(added, value) } } for oldUID := range oldUIDSet { removed = append(removed, oldUIDToRef[oldUID]) } return added, removed, changed } func deletionStartsWithFinalizer(oldObj interface{}, newAccessor metav1.Object, matchingFinalizer string) bool {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 36.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/MutableGraph.java
boolean putEdge(EndpointPair<N> endpoints); /** * Removes {@code node} if it is present; all edges incident to {@code node} will also be removed. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean removeNode(N node); /** * Removes the edge connecting {@code nodeU} to {@code nodeV}, if it is present. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.9K bytes - Viewed (0)