- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 328 for node12 (0.55 sec)
-
android/guava/src/com/google/common/graph/MutableNetwork.java
* * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will * silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph. * * <p>If {@code edge} already connects {@code nodeU} to {@code nodeV} (in the specified order if * this network {@link #isDirected()}, else in any order), then this method will have no effect. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/FarthestConflictResolver.java
* org.apache.maven.artifact.resolver.ResolutionNode) */ public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) { return node1.getDepth() >= node2.getDepth() ? node1 : node2; }
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
common-protos/k8s.io/api/storage/v1/generated.proto
// refer to a given node as "node1", but the storage system may refer to // the same node as "nodeA". When Kubernetes issues a command to the storage // system to attach a volume to a specific node, it can use this field to // refer to the node name using the ID that the storage system will // understand, e.g. "nodeA" instead of "node1". This field is required. optional string nodeID = 2;
Plain Text - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 24.7K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/conflict/NearestConflictResolver.java
* org.apache.maven.artifact.resolver.ResolutionNode) */ public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) { return node1.getDepth() <= node2.getDepth() ? node1 : node2; }
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 1.7K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
ASSERT_EQ(nodes.size(), fdef.node_def_size()) << "Got unexpected number of nodes. Expected: [" << absl::StrJoin(nodes, ", ") << "] Actual nodes in fdef: " << fdef.DebugString(); for (const NodeDef& node_def : fdef.node_def()) { ASSERT_TRUE(nodes.find(node_def.name()) != nodes.end()) << "Got unexpected node: " << node_def.name()
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Jul 20 22:08:54 GMT 2023 - 63.6K bytes - Viewed (6) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
@Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
"Cannot add self-loop edge on node %s, as self-loops are not allowed. To construct a graph " + "that allows self-loops, call allowsSelfLoops(true) on the Builder."; static final String NOT_AVAILABLE_ON_UNDIRECTED = "Cannot call source()/target() on a EndpointPair from an undirected graph. Consider calling " + "adjacentNode(node) if you already have a node, or nodeU()/nodeV() if you don't.";
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
common-protos/k8s.io/api/storage/v1beta1/generated.proto
// refer to a given node as "node1", but the storage system may refer to // the same node as "nodeA". When Kubernetes issues a command to the storage // system to attach a volume to a specific node, it can use this field to // refer to the node name using the ID that the storage system will // understand, e.g. "nodeA" instead of "node1". This field is required. optional string nodeID = 2;
Plain Text - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 24.9K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/rpc.java
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 20:40:13 GMT 2019 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/IncidentEdgeSet.java
return (node.equals(source) && graph.successors(node).contains(target)) || (node.equals(target) && graph.predecessors(node).contains(source)); } else { if (endpointPair.isOrdered()) { return false; } Set<N> adjacent = graph.adjacentNodes(node); Object nodeU = endpointPair.nodeU(); Object nodeV = endpointPair.nodeV();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0)