- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for predecessor (0.23 sec)
-
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 18K bytes - Viewed (0) -
guava/src/com/google/common/graph/DirectedGraphConnections.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 18K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/breakup-islands.cc
const auto predecessors = side_effect_analysis.DirectControlPredecessors(&sub_op); // Get the controls from the predecessors. llvm::SmallVector<Value, 4> predecessor_controls; predecessor_controls.reserve(predecessors.size()); for (auto predecessor : predecessors) { predecessor_controls.push_back(new_control_for_sub_ops[predecessor]); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Aug 11 20:52:36 UTC 2023 - 16.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} assertThat( graph.predecessors(node).contains(adjacentNode) || graph.successors(node).contains(adjacentNode)) .isTrue(); } for (N predecessor : sanityCheckSet(graph.predecessors(node))) { assertThat(graph.successors(predecessor)).contains(node); assertThat(graph.hasEdgeConnecting(predecessor, node)).isTrue();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.cc
for (auto& entry : control_predecessors_) { auto op = entry.getFirst(); auto& predecessors = entry.getSecond(); auto& sorted_predecessors = sorted_control_predecessors_[op]; for (Operation* predecessor : predecessors) { sorted_predecessors.push_back(predecessor); sorted_control_successors_[predecessor].push_back(op); } } control_predecessors_.clear();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 41.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} // insertion point for new entry is after predecessor // note predecessor must still be a valid entry: either we deleted an entry that was *not* // predecessor, or we didn't delete anything ensureCapacity(size + 1); keys[size] = key; values[size] = value; insertIntoTableKToV(size, keyHash); insertIntoTableVToK(size, valueHash);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 36.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/go/types/initorder.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/DefaultFinalizedExecutionPlan.java
for (Node predecessor : node.getDependencyPredecessors()) { predecessor.addDependencySuccessor(postNode); predecessor.forceAllDependenciesCompleteUpdate(); if (!predecessor.allDependenciesComplete()) { readyNodes.removeAndRestart(predecessor); } }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 28 21:49:39 UTC 2022 - 28.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/check_control_dependencies.cc
worklist.push(user_island); pred_map[user_island] = curr_op; } } // Construct path by following predecessor pointers. IslandOp curr_op = target_op; while (curr_op != source_op) { // If we don't have a predecessor pointer here, then there is no // source-target path. if (pred_map.count(curr_op) == 0) return false; path.push_back(curr_op);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Oct 05 23:50:19 UTC 2022 - 10.2K bytes - Viewed (0)