- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 374 for nodes (0.12 sec)
-
android/guava/src/com/google/common/graph/AbstractNetwork.java
* given nodes is not present in this network. * * @since 33.1.0 */ protected final <T> Set<T> nodePairInvalidatableSet(Set<T> set, N nodeU, N nodeV) { return InvalidatableSet.of( set, () -> nodes().contains(nodeU) && nodes().contains(nodeV), () -> String.format(NODE_PAIR_REMOVED_FROM_GRAPH, nodeU, nodeV)); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/admin/maintenance/AdminMaintenanceAction.java
writeElastisearchJsonApi(zos, id, "nodes", "stats"); writeElastisearchJsonApi(zos, id, "nodes", "_all"); writeElastisearchJsonApi(zos, id, "nodes", "usage"); writeElastisearchJsonApi(zos, id, "remote", "info"); writeElastisearchJsonApi(zos, id, "tasks", ""); writeElastisearchJsonApi(zos, id, "nodes", "hot_threads"); }
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 14K bytes - Viewed (0) -
cmd/peer-s3-client.go
nodes := endpoints.GetNodes() peers = make([]peerS3Client, len(nodes)) for i, node := range nodes { if node.IsLocal { peers[i] = &localPeerS3Client{node: node} } else { peers[i] = newPeerS3Client(node) } peers[i].SetPools(node.Pools) } return peers } // Returns a peer S3 client. func newPeerS3Client(node Node) peerS3Client {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 14.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
@Override @Test public void nodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<Integer> nodes = graph.nodes(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); addNode(N1); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @Override @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
tensorflow/c/c_api.cc
// Fill graph_def with nodes with ids in the range // [session->last_num_graph_nodes, num_nodes), that is the nodes // added since the last TF_SessionRun() call. for (auto id = session->last_num_graph_nodes; id < num_nodes; ++id) { Node* const node = graph.FindNodeId(id); if (node != nullptr && node->IsOp()) { NodeDef* const node_def = graph_def.add_node();
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 102.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/entity/PingResponse.java
private static final String STATUS = "status"; private static final String TIMED_OUT = "timed_out"; private static final String NUMBER_OF_NODES = "number_of_nodes"; private static final String NUMBER_OF_DATA_NODES = "number_of_data_nodes"; private static final String NUMBER_OF_PENDING_TASKS = "number_of_pending_tasks"; private static final String NUMBER_OF_IN_FLIGHT_FETCH = "number_of_in_flight_fetch";
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 5.9K bytes - Viewed (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.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
common-protos/k8s.io/api/node/v1beta1/generated.proto
// https://git.k8s.io/enhancements/keps/sig-node/688-pod-overhead/README.md // +optional optional Overhead overhead = 3; // scheduling holds the scheduling constraints to ensure that pods running // with this RuntimeClass are scheduled to nodes that support it. // If scheduling is nil, this RuntimeClass is assumed to be supported by all // nodes. // +optional optional Scheduling scheduling = 4; }
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 4.4K 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(); } }
C++ - Registered: Tue Feb 27 12:39:08 GMT 2024 - Last Modified: Wed Sep 06 19:12:29 GMT 2023 - 15K bytes - Viewed (1) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void validateUndirectedEdges() { for (Integer node : network.nodes()) { new EqualsTester() .addEqualityGroup( network.inEdges(node), network.outEdges(node), network.incidentEdges(node)) .testEquals(); new EqualsTester() .addEqualityGroup( network.predecessors(node), network.successors(node), network.adjacentNodes(node)) .testEquals();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 19.3K bytes - Viewed (0)