- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 152 for predecessor (0.2 sec)
-
tensorflow/compiler/mlir/tensorflow/tests/side-effect-analysis-test.mlir
// expected-remark@above {{Predecessors: {6}}} // expected-remark@above {{Successors: {8}}} tf_executor.yield %read3 : tensor<32xf32> // expected-remark@above {{ID: 8}} // expected-remark@above {{Predecessors: {4,5,7}}} } tf_executor.fetch %island#0 : tensor<32xf32> // expected-remark@above {{ID: 10}} // expected-remark@above {{Predecessors: {9}}} }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Dec 20 04:39:18 UTC 2023 - 129.7K bytes - Viewed (0) -
src/runtime/mheap.go
} unlock(&span.speciallock) releasem(mp) return result } // Find a splice point in the sorted list and check for an already existing // record. Returns a pointer to the next-reference in the list predecessor. // Returns true, if the referenced item is an exact match. func (span *mspan) specialFindSplicePoint(offset uintptr, kind byte) (**special, bool) { // Find splice point, check for existing record.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assume().that(graphIsMutable()).isTrue(); addNode(N2); Set<Integer> predecessors = graph.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); putEdge(N1, N2); assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); } @Override @Test public void successors_checkReturnedSetMutability() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* which has a method {@code getParents()} that retrieves its predecessors in a graph: * * <pre>{@code * someGraphAlgorithm(startNode, MyNode::getParents); * }</pre> * * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/PredecessorsFunction.java
* which has a method {@code getParents()} that retrieves its predecessors in a graph: * * <pre>{@code * someGraphAlgorithm(startNode, MyNode::getParents); * }</pre> * * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void predecessors_checkReturnedSetMutability() { addNode(N2); Set<Integer> predecessors = network.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); addEdge(N1, N2, E12); assertThat(network.predecessors(N2)).containsExactlyElementsIn(predecessors); } @Override @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
return delegate().incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public int degree(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/replicate_tensor_list_init_ops.mlir
%while:1 = "tf.WhileRegion"(%tl) ({ ^bb0(%barg1: tensor<!tf_type.variant<tensor<?x1xf32>>>): // no predeceessors %cond = "tf.false"():()-> tensor<i1> "tf.Yield"(%cond) : (tensor<i1>) -> () }, { ^bb0(%barg1: tensor<!tf_type.variant<tensor<?x1xf32>>>): // no predeceessors "tf.Yield"(%barg1) : (tensor<!tf_type.variant<tensor<?x1xf32>>>) -> ()
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sun Jan 22 17:28:34 UTC 2023 - 8.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/ForwardingValueGraph.java
return delegate().incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public int degree(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().incidentEdgeOrder(); } @Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.5K bytes - Viewed (0)