- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 261 for edges (0.04 sec)
-
tensorflow/c/c_api.h
// must be either listed in `inputs` or must come from another node in // the body. In particular, it is an error to have a control edge going from // a node outside of the body into a node in the body. This applies to control // edges going from nodes referenced in `inputs` to nodes in the body when // the former nodes are not in the body (automatically skipped or not
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Thu Oct 26 21:08:15 UTC 2023 - 82.3K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
ASSERT_EQ(1, TF_OperationNumInputs(neg)); TF_Output neg_input = TF_OperationInput({neg, 0}); EXPECT_EQ(scalar, neg_input.oper); EXPECT_EQ(0, neg_input.index); // Test that we can't see control edges involving the source and sink nodes. TF_Operation* control_ops[100]; EXPECT_EQ(0, TF_OperationNumControlInputs(scalar)); EXPECT_EQ(0, TF_OperationGetControlInputs(scalar, control_ops, 100));
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Fri Dec 27 12:18:10 UTC 2024 - 97K bytes - Viewed (0) -
okhttp/src/jvmMain/resources/okhttp3/internal/publicsuffix/PublicSuffixDatabase.list
cc.ri.us cc.sc.us cc.sd.us cc.tn.us cc.tx.us cc.ua cc.ut.us cc.va.us cc.vi.us cc.vt.us cc.wa.us cc.wi.us cc.wv.us cc.wy.us cci.fr cd cd.eu.org cdn-edges.net cdn.cloudflare.net cdn.cloudflareanycast.net cdn.cloudflarecn.net cdn.cloudflareglobal.net cdn.prod.atlassian-dev.net cdn77-ssl.net cdn77-storage.com ce.gov.br ce.it ce.leg.br
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue May 27 22:00:49 UTC 2025 - 129.6K bytes - Viewed (3) -
okhttp/src/androidMain/assets/PublicSuffixDatabase.list
cc.ri.us cc.sc.us cc.sd.us cc.tn.us cc.tx.us cc.ua cc.ut.us cc.va.us cc.vi.us cc.vt.us cc.wa.us cc.wi.us cc.wv.us cc.wy.us cci.fr cd cd.eu.org cdn-edges.net cdn.cloudflare.net cdn.cloudflareanycast.net cdn.cloudflarecn.net cdn.cloudflareglobal.net cdn.prod.atlassian-dev.net cdn77-ssl.net cdn77-storage.com ce.gov.br ce.it ce.leg.br
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Dec 31 14:50:53 UTC 2024 - 129.6K bytes - Viewed (2) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
} // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
} // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPair.java
/** * An immutable pair representing the two endpoints of an edge in a graph. The {@link EndpointPair} * of a directed edge is an ordered pair of nodes ({@link #source()} and {@link #target()}). The * {@link EndpointPair} of an undirected edge is an unordered pair of nodes ({@link #nodeU()} and * {@link #nodeV()}). * * <p>The edge is a self-loop if, and only if, the two endpoints are equal. * * @author James SextonRegistered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
/** * An immutable pair representing the two endpoints of an edge in a graph. The {@link EndpointPair} * of a directed edge is an ordered pair of nodes ({@link #source()} and {@link #target()}). The * {@link EndpointPair} of an undirected edge is an unordered pair of nodes ({@link #nodeU()} and * {@link #nodeV()}). * * <p>The edge is a self-loop if, and only if, the two endpoints are equal. * * @author James SextonRegistered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 8.1K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbTransportInternalTest.java
SmbException ex = assertThrows(SmbException.class, () -> transport.hasCapability(42)); assertTrue(ex.getMessage().contains("failed")); verify(transport).hasCapability(42); } // Edge: disconnected status toggles @ParameterizedTest @DisplayName("isDisconnected reflects current mocked state") @ValueSource(booleans = { true, false }) void isDisconnected_states(boolean disconnected) {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 12.1K bytes - Viewed (0) -
tensorflow/c/c_api.cc
mutex_lock l(graph->mu); std::vector<const tensorflow::Edge*> control_edges; for (const tensorflow::Edge* edge : op->node.in_edges()) { if (!edge->IsControlEdge()) continue; control_edges.push_back(edge); } for (const tensorflow::Edge* edge : control_edges) { graph->graph.RemoveControlEdge(edge); } } void TF_SetRequireShapeInferenceFns(TF_Graph* graph, bool require) {
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Tue May 13 06:30:43 UTC 2025 - 102.3K bytes - Viewed (0)