- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 58 for Predecessors (0.18 sec)
-
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
} @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodeValues.keySet()); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 06 00:47:57 UTC 2021 - 3.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tf_test_passes.td
} def TestSideEffectAnalysisPass : Pass<"tf-test-side-effect-analysis", "ModuleOp"> { let summary = "Test pass for analyzing side-effect analysis result"; let description = [{ Adds "Predecessors" and "Successors" remarks for each op based on the SideEffectAnalysis result. For testing purpose only. }]; let constructor = "::mlir::tf_test::CreateTestSideEffectAnalysisPass()"; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 03 00:21:29 UTC 2023 - 4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/trim.go
f.Blocks[n] = b n++ continue } bPos := b.Pos bIsStmt := bPos.IsStmt() == src.PosIsStmt // Splice b out of the graph. NOTE: `mergePhi` depends on the // order, in which the predecessors edges are merged here. p, i := b.Preds[0].b, b.Preds[0].i s, j := b.Succs[0].b, b.Succs[0].i ns := len(s.Preds) p.Succs[i] = Edge{s, j} s.Preds[j] = Edge{p, i} for _, e := range b.Preds[1:] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.2K bytes - Viewed (0) -
docs/en/docs/history-design-future.md
As part of that, I needed to investigate, test and use many alternatives. The history of **FastAPI** is in great part the history of its predecessors. As said in the section [Alternatives](alternatives.md){.internal-link target=_blank}: <blockquote markdown="1"> **FastAPI** wouldn't exist if not for the previous work of others.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Mar 22 01:42:11 UTC 2024 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/GraphBuilder.java
return newBuilder; } /** * Specifies the order of iteration for the elements of {@link Graph#edges()}, {@link * Graph#adjacentNodes(Object)}, {@link Graph#predecessors(Object)}, {@link * Graph#successors(Object)} and {@link Graph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
return newBuilder; } /** * Specifies the order of iteration for the elements of {@link ValueGraph#edges()}, {@link * ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
return newBuilder; } /** * Specifies the order of iteration for the elements of {@link Graph#edges()}, {@link * Graph#adjacentNodes(Object)}, {@link Graph#predecessors(Object)}, {@link * Graph#successors(Object)} and {@link Graph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
Map<K, V> result = super.convertToHashFloodingResistantImplementation(); links = null; return result; } /* * For discussion of the safety of the following methods for operating on predecessors and * successors, see the comments near the end of CompactHashMap, noting that the methods here call * link(), which is defined at the end of this file. */ private int getPredecessor(int entry) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/cluster_util.cc
const TF::SideEffectAnalysis::Info& side_effect_analysis, std::function<std::string(Operation*)> get_target, const llvm::DenseMap<Operation*, Cluster*>& op_to_cluster_map) { // If any of the op's control predecessors appears after the last op in the // cluster, merging the op may cause control dependencies to be reordered. // Hence, the op cannot be merged to the cluster in such a case. const bool has_control_predecessors_after_cluster =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Jul 28 00:32:55 UTC 2023 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraphBuilder.java
return newBuilder; } /** * Specifies the order of iteration for the elements of {@link ValueGraph#edges()}, {@link * ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 8K bytes - Viewed (0)