- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 1,706 for _nodes (0.18 sec)
-
cluster/addons/rbac/kubelet-api-auth/kubelet-api-admin-role.yaml
apiVersion: rbac.authorization.k8s.io/v1 kind: ClusterRole metadata: name: kubelet-api-admin labels: addonmanager.kubernetes.io/mode: Reconcile rules: - apiGroups: - "" resources: - nodes/proxy - nodes/log - nodes/stats - nodes/metrics verbs:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 21 18:57:07 UTC 2022 - 323 bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/inspector/inspector.go
f(ev.node, false) } } i++ } } // WithStack visits nodes in a similar manner to Nodes, but it // supplies each call to f an additional argument, the current // traversal stack. The stack's first element is the outermost node, // an *ast.File; its last is the innermost, n. func (in *Inspector) WithStack(types []ast.Node, f func(n ast.Node, push bool, stack []ast.Node) (proceed bool)) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 6.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPairIterator.java
* EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip * EndpointPair [N3, N2] - skip * Visited Nodes = {N1, N2, N3} * EndpointPair [N4, N4] - return * Visited Nodes = {N1, N2, N3, N4} * </pre> */ private static final class Undirected<N> extends EndpointPairIterator<N> {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jul 09 17:31:04 UTC 2021 - 5K bytes - Viewed (0) -
src/internal/dag/alg.go
func (g *Graph) TransitiveReduction() { // For i -> j -> k, if i -> k exists, delete it. for _, i := range g.Nodes { for _, j := range g.Nodes { if g.HasEdge(i, j) { for _, k := range g.Nodes { if g.HasEdge(j, k) { g.DelEdge(i, k) } } } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 04 15:31:44 UTC 2022 - 1.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
validateEndpoints(endpoints); return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV()); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) { return false;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/graphdef2mlir/target.pbtxt
# PRUNE-NEXT: tf_executor.fetch %[[ASSIGN_ADD_CTRL]] # Tests multiple target nodes with pruning set. Unreachable nodes from the # fetch, including side effecting nodes, will be removed. The target nodes are # added to the graph fetch as controls. # # PRESERVE-LABEL: func @main # PRESERVE-SAME: control_outputs = "Variable/Assign,AssignAdd"
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 10 19:53:21 UTC 2020 - 4.4K bytes - Viewed (0) -
cmd/kubeadm/app/phases/upgrade/health.go
} // getNotReadyNodes returns a string slice of nodes in the cluster that are NotReady func getNotReadyNodes(nodes []v1.Node) []string { var notReadyNodes []string for _, node := range nodes { for _, condition := range node.Status.Conditions { if condition.Type == v1.NodeReady && condition.Status != v1.ConditionTrue { notReadyNodes = append(notReadyNodes, node.ObjectMeta.Name) } } } return notReadyNodes
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 26 09:18:02 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
checkNotNull(nodeU); checkNotNull(nodeV); return nodes().contains(nodeU) && successors(nodeU).contains(nodeV); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) { return false; } N nodeU = endpoints.nodeU(); N nodeV = endpoints.nodeV();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
tensorflow/c/experimental/grappler/grappler.cc
TF_SetStatus(status, TF_OK, ""); const std::unordered_set<std::string>& nodes = reinterpret_cast<const tensorflow::grappler::GrapplerItem*>(item) ->NodesToPreserve(); *num_values = nodes.size(); *storage_size = 0; for (const std::string& str : nodes) { *storage_size += str.size(); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 15K bytes - Viewed (0)