- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,213 for Node (0.19 sec)
-
api/maven-api-core/src/main/java/org/apache/maven/api/Node.java
*/ @Nullable Dependency getDependency(); /** * Gets the child nodes of this node. * * @return the child nodes of this node, never {@code null} */ @Nonnull List<Node> getChildren(); /** * @return repositories of this node */ @Nonnull List<RemoteRepository> getRemoteRepositories(); /**
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Dec 08 08:42:44 GMT 2023 - 3.2K bytes - Viewed (0) -
docs/metrics/prometheus/grafana/node/minio-node.json
Json - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Mar 28 15:14:26 GMT 2024 - 23.1K bytes - Viewed (0) -
docs/metrics/prometheus/grafana/node/grafana-node.png
grafana-node.png...
PNG Image - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Mar 28 15:14:26 GMT 2024 - 152.3K bytes - Viewed (0) -
docs/metrics/prometheus/grafana/replication/minio-replication-node.json
Json - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Mar 28 17:15:39 GMT 2024 - 57.5K bytes - Viewed (0) -
docs/metrics/prometheus/grafana/replication/grafana-replication-node.png
grafana-replication-node.png...
PNG Image - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Mar 28 17:15:39 GMT 2024 - 229.7K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Huffman.kt
val childIndex = (accumulator ushr (accumulatorBitCount - 8)) and 0xff node = node.children!![childIndex]!! if (node.children == null) { // Terminal node. sink.writeByte(node.symbol) accumulatorBitCount -= node.terminalBitCount node = root } else { // Non-terminal node. accumulatorBitCount -= 8 } } }
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 8.3K bytes - Viewed (0) -
tensorflow/c/c_api_function.cc
TF_EXCLUSIVE_LOCKS_REQUIRED(fn_body->mu) { if (num_opers == -1) { for (const Node* node : fn_body->graph.op_nodes()) { const auto& iter = input_nodes.find(node); if (iter == input_nodes.end()) { // This node is not referenced in inputs. Add it to the body. body_nodes->push_back(node); } else { // This node is referenced in inputs. Currently, we place an
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 13.6K bytes - Viewed (2) -
android/guava/src/com/google/common/graph/Graphs.java
* not be updated after modifications to {@code graph}. * * @throws IllegalArgumentException if {@code node} is not present in {@code graph} * @since 33.1.0 (present with return type {@code Set} since 20.0) */ public static <N> ImmutableSet<N> reachableNodes(Graph<N> graph, N node) { checkArgument(graph.nodes().contains(node), NODE_NOT_IN_GRAPH, node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
*/ Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
if (isDirected()) { return IntMath.saturatedAdd(predecessors(node).size(), successors(node).size()); } else { Set<N> neighbors = adjacentNodes(node); int selfLoopCount = (allowsSelfLoops() && neighbors.contains(node)) ? 1 : 0; return IntMath.saturatedAdd(neighbors.size(), selfLoopCount); } } @Override public int inDegree(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0)