- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 265 for Edges (0.03 sec)
-
tensorflow/compiler/jit/resource_operation_safety_analysis.cc
// enforce arbitrary ordering dependencies (via control or data edges) between // resource operations. Since all resource reads happen before all resource // writes, edges constraining resource reads to happen before resource writes // are fine, but all other kinds of edges are problematic. This analysis // computes the set of pairs of resource operations that cannot be put in the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 11.2K bytes - Viewed (0) -
platforms/native/language-native/src/main/java/org/gradle/language/nativeplatform/internal/incremental/IncrementalCompileFilesFactory.java
this.included = included; this.edges = edges; this.includeFileDirectives = dependentIncludeDirectives; } FileVisitResult(File file) { this.file = file; result = IncludeFileResolutionResult.NoMacroIncludes; includeDirectives = null; included = Collections.emptyList(); edges = Collections.emptyList();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 14.6K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph_test.go
g.getOrCreateVertex_locked(nodeVertexType, "", "node1") return g }(), }, { // two edges from the same configmap to distinct nodes, will delete one of the edges desc: "edges are deleted, non-orphans and destination orphans are preserved", fromType: configMapVertexType, toType: nodeVertexType, toNamespace: "", toName: "node2",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Sep 23 23:14:19 UTC 2022 - 12.3K 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 */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 06 00:47:57 UTC 2021 - 2.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/NetworkBuilder.java
* user-defined properties. * * <p>A {@code Network} built by this class has the following default properties: * * <ul> * <li>does not allow parallel edges * <li>does not allow self-loops * <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the * elements were added (insertion order) * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
@ElementTypesAreNonnullByDefault abstract class AbstractBaseGraph<N> implements BaseGraph<N> { /** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance. */ protected long edgeCount() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
return new AbstractGraph<N>() { @Override public Set<N> nodes() { return AbstractValueGraph.this.nodes(); } @Override public Set<EndpointPair<N>> edges() { return AbstractValueGraph.this.edges(); } @Override public boolean isDirected() { return AbstractValueGraph.this.isDirected(); } @Override public boolean allowsSelfLoops() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* @since 23.0 */ @Beta @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges") @ElementTypesAreNonnullByDefault public interface SuccessorsFunction<N> { /** * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/EdgesConnecting.java
import java.util.Map; import javax.annotation.CheckForNull; /** * A class to represent the set of edges connecting an (implicit) origin node to a target node. * * <p>The {@link #nodeToOutEdge} map means this class only works on networks without parallel edges. * See {@link MultiEdgesConnecting} for a class that works with parallel edges. * * @author James Sexton * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0)