- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for OutEdge (0.17 sec)
-
tensorflow/compiler/jit/node_matchers.h
} // Matches the `idx`'th output of a node that matches `node`. ::testing::Matcher<impl::OutEdge> Out(int oidx, ::testing::Matcher<const Node*> node); // Matches the first output of a node that matches `node`. inline ::testing::Matcher<impl::OutEdge> Out( ::testing::Matcher<const Node*> node) { return Out(0, node); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 8.1K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
delete(parent.Out, cur) // Reconfigure every edge from the current node to now begin at the parent. for _, outEdge := range cur.Out { child := outEdge.Dest delete(child.In, cur) child.In[parent] = outEdge parent.Out[child] = outEdge outEdge.Src = parent outEdge.Residual = true // If the edge from the parent to the current node and the edge from the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/critical.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package ssa // critical splits critical edges (those that go from a block with // more than one outedge to a block with more than one inedge). // Regalloc wants a critical-edge-free CFG so it can implement phi values. func critical(f *Func) { // maps from phi arg ID to the new block created for that argument
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.1K bytes - Viewed (0) -
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) -
src/cmd/compile/internal/ssa/prove.go
ft.unsat = true if b.Func.pass.debug > 2 { b.Func.Warnl(b.Pos, "block=%s outedge=%d %s=%d unsat", b, idx, c, val) } } else { ft.limits[c.ID] = limit{val, val, uint64(val), uint64(val)} if b.Func.pass.debug > 2 { b.Func.Warnl(b.Pos, "block=%s outedge=%d %s=%d", b, idx, c, val) } } default: panic("unknown branch") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assume().that(graphIsMutable()).isTrue(); putEdge(N1, N2); putEdge(N1, N3); putEdge(N1, N4); assertThat(graphAsMutableGraph.removeEdge(N1, N3)).isTrue(); assertThat(graph.adjacentNodes(N1)).containsExactly(N2, N4); } @Test public void removeEdge_nodeNotPresent() { assume().that(graphIsMutable()).isTrue(); putEdge(N1, N2);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
* <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate putEdge(4, 5); } // Element Mutation @Test public void putEdge_existingNodes() { assume().that(graphIsMutable()).isTrue();
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/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
// will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it. if (graph.isDirected()) { // Note: works for both directed and undirected graphs, but we only use in the directed case. for (N node : graph.nodes()) { for (N reachableNode : reachableNodes(graph, node)) { transitiveClosure.putEdge(node, reachableNode); } } } else {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0)