- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 246 for nodeIP (0.04 seconds)
-
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
for (E key : keys) { LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal.
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 17:06:34 GMT 2025 - 35.9K bytes - Click Count (0) -
guava/src/com/google/common/graph/ValueGraph.java
int outDegree(N node); /** * Returns true if there is an edge that directly connects {@code nodeU} to {@code nodeV}. This is * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}. * * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}. * * @since 23.0 */ @Override boolean hasEdgeConnecting(N nodeU, N nodeV); /**
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 16K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
for (E key : keys) { LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal.
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 17:06:34 GMT 2025 - 35.9K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
/** * A value class representing single connection between the origin node and another node. * * <p>There can be two types of connections (predecessor and successor), which is represented by * the two implementations. */ private abstract static class NodeConnection<N> { final N node; NodeConnection(N node) { this.node = checkNotNull(node); } static final class Pred<N> extends NodeConnection<N> {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Jan 18 02:54:30 GMT 2025 - 17.8K bytes - Click Count (0) -
docs/metrics/prometheus/grafana/node/minio-node.json
"enable": true, "hide": true, "iconColor": "rgba(0, 211, 255, 1)", "name": "Annotations & Alerts", "type": "dashboard" } ] }, "description": "MinIO Nodes Grafana Dashboard - https://min.io/", "editable": true, "fiscalYearStartMonth": 0, "gnetId": 15306, "graphTooltip": 0, "id": 267, "links": [ { "icon": "external link",
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Mon Aug 04 01:46:49 GMT 2025 - 22.5K bytes - Click Count (0) -
api/maven-api-xml/src/main/java/org/apache/maven/api/xml/XmlNode.java
import org.apache.maven.api.annotations.ThreadSafe; /** * An immutable XML node representation that provides a clean API for working with XML data structures. * This interface represents a single node in an XML document tree, containing information about * the node's name, value, attributes, and child nodes. * * <p>Example usage:</p> * <pre> * XmlNode node = XmlNode.newBuilder() * .name("configuration")
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Wed Dec 17 15:20:44 GMT 2025 - 18.3K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
checkArgument( edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge); char node1 = edge.charAt(0); char node2 = edge.charAt(1); graphMapBuilder.put(node1, node2); if (!directed) { graphMapBuilder.put(node2, node1); } } ImmutableMultimap<Character, Character> graphMap = graphMapBuilder.build();
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 47.4K bytes - Click Count (2) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/JavadocConverter.java
handler.add(new LinkHandler(nodes, linkConverter, classMetaData, listener)); handler.add(new InheritDocHandler(nodes, inheritedCommentSource)); handler.add(new ValueTagHandler(nodes, linkConverter, classMetaData, listener)); handler.add(new LiteralTagHandler(nodes)); handler.add(new TableHandler(nodes, document)); handler.add(new DlElementHandler(nodes, document));
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Wed May 21 06:20:45 GMT 2025 - 29.3K bytes - Click Count (0) -
tensorflow/c/c_api_function.cc
// nodes must have a single output. if (node->num_outputs() != 1) { return InvalidArgument( "When `num_opers` is set to -1, nodes referenced in `inputs` " "must have a single output. Node ", node->name(), " has ", node->num_outputs(), " outputs. Encountered while creating function '", fn_name, "'"); } } }Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Sat Oct 12 16:27:48 GMT 2024 - 13.7K bytes - Click Count (0) -
scripts/notify_translations.py
all_discussions_query = """ query Q($category_id: ID) { repository(name: "fastapi", owner: "fastapi") { discussions(categoryId: $category_id, first: 100) { nodes { title id number labels(first: 10) { edges { node { id name } } } } } } } """ translation_discussion_query = """Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 21:25:59 GMT 2025 - 12.7K bytes - Click Count (0)