| 36 | using ::testing::Ne; |
| 37 | |
| 38 | TEST(SubgraphTest, Comparison) { |
| 39 | GraphDef graph; |
| 40 | // A topology with a loop. |
| 41 | (*graph.add_node()) = MakeNodeConst("node1"); |
| 42 | (*graph.add_node()) = MakeNodeConst("node2"); |
| 43 | GenNodeMap map; |
| 44 | ASSERT_THAT(GenNode::BuildGraphInMap(graph, &map), Eq(Status::OK())); |
| 45 | auto gn1 = map["node1"].get(); |
| 46 | auto gn2 = map["node2"].get(); |
| 47 | ASSERT_THAT(gn1, Ne(nullptr)); |
| 48 | ASSERT_THAT(gn2, Ne(nullptr)); |
| 49 | |
| 50 | Subgraph::Identity id1; |
| 51 | Subgraph::Identity id2; |
| 52 | |
| 53 | id1.insert(gn1); |
| 54 | id2.insert(gn2); |
| 55 | |
| 56 | Subgraph sg1(id1); |
| 57 | Subgraph sg2(id2); |
| 58 | |
| 59 | EXPECT_TRUE(id1 == sg1.id()); |
| 60 | EXPECT_TRUE(id2 == sg2.id()); |
| 61 | |
| 62 | EXPECT_THAT(sg1 < sg2, Eq(id1 < id2)); |
| 63 | } |
| 64 | |
| 65 | TEST(SubgraphTest, EmptyIteration) { |
| 66 | NodeDef node1 = MakeNodeConst("node1"); |
nothing calls this directly
no test coverage detected