- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 126 for Geddes (0.21 sec)
-
tensorflow/c/c_api_function_test.cc
} // If caller specified all edges, check that we have seen all if (is_exact_edges) { ASSERT_EQ(e_edges.size() + c_edges.size(), a_edges.size()) << "Expected edges: " << ToString(e_edges) << " Expected Control edges: " << ToString(c_edges) << " Actual edges: " << ToString(a_edges) << " in fdef: " << fdef.DebugString(); } }
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) -
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
return AbstractNetwork.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override
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/jcifs/util/Crypto.java
} /** * @param key * 7 or 8 byte DES key * @return DES cipher in encryption mode */ public static Cipher getDES ( byte[] key ) { if ( key.length == 7 ) { return getDES(des7to8(key)); } try { Cipher c = Cipher.getInstance("DES/ECB/NoPadding"); c.init(Cipher.ENCRYPT_MODE, new SecretKeySpec(key, "DES"));
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Tue Aug 17 17:34:29 GMT 2021 - 5.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(edges).hasSize(2); assertThat(edges).contains(EndpointPair.unordered(N1, N1)); assertThat(edges).contains(EndpointPair.unordered(N1, N2)); assertThat(edges).contains(EndpointPair.unordered(N2, N1)); // equal to unordered(N1, N2) // ordered endpoints not compatible with undirected graph assertThat(edges).doesNotContain(EndpointPair.ordered(N1, N2));
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/EndpointPairTest.java
assertThat(edges).hasSize(2); assertThat(edges).contains(EndpointPair.unordered(N1, N1)); assertThat(edges).contains(EndpointPair.unordered(N1, N2)); assertThat(edges).contains(EndpointPair.unordered(N2, N1)); // equal to unordered(N1, N2) // ordered endpoints not compatible with undirected graph assertThat(edges).doesNotContain(EndpointPair.ordered(N1, N2));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
.isTrue(); } ArrayList<Object> edgeList = new ArrayList<>(network.edges()); assertThat(network.nodes()).hasSize(NUM_NODES); assertThat(network.edges()).hasSize(NUM_EDGES); AbstractNetworkTest.validateNetwork(network); Collections.shuffle(edgeList, gen); int numEdgesToRemove = gen.nextInt(NUM_EDGES); for (int i = 0; i < numEdgesToRemove; ++i) { Object edge = edgeList.get(i);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MultiEdgesConnecting.java
import java.util.Map.Entry; import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #outEdgeToNode} map allows this class to work on networks with parallel edges. See * {@link EdgesConnecting} for a class that is more efficient but forbids parallel edges. * * @author James Sexton * @param <E> Edge parameter type */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
@Override public Set<N> nodes() { return delegate().nodes(); } /** * Defer to {@link AbstractGraph#edges()} (based on {@link #successors(Object)}) for full edges() * implementation. */ @Override protected long edgeCount() { return delegate().edges().size(); } @Override public boolean isDirected() { return delegate().isDirected(); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
NetworkBuilder.directed().edgeOrder(insertion()).build(); addEdges(network); assertThat(network.edgeOrder()).isEqualTo(ElementOrder.insertion()); assertThat(network.edges()).containsExactly("i", "e", "p").inOrder(); assertThat(network.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default } // The default ordering is INSERTION unless otherwise specified. @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0)