- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 838 for nodev1 (0.18 sec)
-
guava/src/com/google/common/graph/StandardValueGraph.java
return hasEdgeConnectingInternal(checkNotNull(nodeU), checkNotNull(nodeV)); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints) && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV()); } @Override @CheckForNull
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
return hasEdgeConnectingInternal(checkNotNull(nodeU), checkNotNull(nodeV)); } @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints) && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV()); } @Override @CheckForNull
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}, and to * {@code edgeConnectingOrNull(nodeU, nodeV) != null}. * * <p>In an undirected network, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ boolean hasEdgeConnecting(N nodeU, N nodeV); /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 22.3K bytes - Viewed (0) -
android/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) -
guava/src/com/google/common/graph/Graphs.java
return delegate().edgeConnecting(nodeV, nodeU); // transpose } @Override public Optional<E> edgeConnecting(EndpointPair<N> endpoints) { return delegate().edgeConnecting(transpose(endpoints)); } @Override @CheckForNull public E edgeConnectingOrNull(N nodeU, N nodeV) { return delegate().edgeConnectingOrNull(nodeV, nodeU); // transpose }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
pkg/controller/daemon/util/daemonset_util_test.go
templateGeneration, newPod("pod1", "node1", labels), hash, true, }, { "templateGeneration matches, hash doesn't", templateGeneration, newPod("pod1", "node1", labels), hash + "123", true, }, { "templateGeneration matches, no hash label, has hash", templateGeneration, newPod("pod1", "node1", labelsNoHash), hash, true, }, {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 14.5K bytes - Viewed (0) -
src/text/template/parse/node.go
) // Nodes. // ListNode holds a sequence of nodes. type ListNode struct { NodeType Pos tr *Tree Nodes []Node // The element nodes in lexical order. } func (t *Tree) newList(pos Pos) *ListNode { return &ListNode{tr: t, NodeType: NodeList, Pos: pos} } func (l *ListNode) append(n Node) { l.Nodes = append(l.Nodes, n) } func (l *ListNode) tree() *Tree {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:57:51 UTC 2024 - 24.2K bytes - Viewed (0) -
cmd/kubeadm/app/cmd/upgrade/node.go
} // Fetches the cluster configuration // NB in case of control-plane node, we are reading all the info for the node; in case of NOT control-plane node // (worker node), we are not reading local API address and the CRI socket from the node object initCfg, err := configutil.FetchInitConfigurationFromCluster(client, nil, "upgrade", !isControlPlaneNode, false) if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 16 08:34:39 UTC 2024 - 10K bytes - Viewed (0) -
pkg/registry/registrytest/node.go
r.Lock() defer r.Unlock() if r.Err != nil { return nil, r.Err } for _, node := range r.Nodes.Items { if node.Name == nodeID { return &node, nil } } return nil, errors.NewNotFound(api.Resource("nodes"), nodeID) } func (r *NodeRegistry) DeleteNode(ctx context.Context, nodeID string) error { r.Lock() defer r.Unlock() var newList []api.Node for _, node := range r.Nodes.Items {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 23:13:50 UTC 2024 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
return delegate().edgeConnectingOrNull(nodeV, nodeU); // transpose } @Override @CheckForNull public E edgeConnectingOrNull(EndpointPair<N> endpoints) { return delegate().edgeConnectingOrNull(transpose(endpoints)); } @Override public boolean hasEdgeConnecting(N nodeU, N nodeV) { return delegate().hasEdgeConnecting(nodeV, nodeU); // transpose
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0)