Searched refs:graph_cycles (Results 1 – 2 of 2) sorted by relevance
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|