@@ -672,15 +672,6 @@ namespace hal {
672
672
EXPECT_TRUE (res.is_ok ());
673
673
EXPECT_EQ (res.get (), std::set<Gate*>({dff4, dff5, dff6}));
674
674
}
675
- {
676
- std::unordered_map<const Net*, std::set<Gate*>> cache;
677
- const auto res1 = trav_dec.get_next_matching_gates (dff2, true , [](const Gate* g) { return g->get_type ()->has_property (GateTypeProperty::ff); }, false , nullptr , nullptr , &cache);
678
- EXPECT_TRUE (res1.is_ok ());
679
- EXPECT_EQ (res1.get (), std::set<Gate*>({dff5, dff6, dff7, dff3}));
680
- const auto res2 = trav_dec.get_next_matching_gates (dff3, true , [](const Gate* g) { return g->get_type ()->has_property (GateTypeProperty::ff); }, false , nullptr , nullptr , &cache);
681
- EXPECT_TRUE (res2.is_ok ());
682
- EXPECT_EQ (res2.get (), std::set<Gate*>({dff6, dff7, dff3}));
683
- }
684
675
685
676
// predecessors
686
677
{
@@ -693,15 +684,6 @@ namespace hal {
693
684
EXPECT_TRUE (res.is_ok ());
694
685
EXPECT_EQ (res.get (), std::set<Gate*>({dff0, dff1, dff2}));
695
686
}
696
- {
697
- std::unordered_map<const Net*, std::set<Gate*>> cache;
698
- const auto res1 = trav_dec.get_next_matching_gates (dff6, false , [](const Gate* g) { return g->get_type ()->has_property (GateTypeProperty::ff); }, false , nullptr , nullptr , &cache);
699
- EXPECT_TRUE (res1.is_ok ());
700
- EXPECT_EQ (res1.get (), std::set<Gate*>({dff1, dff2, dff3, sff0, sff1}));
701
- const auto res2 = trav_dec.get_next_matching_gates (dff7, false , [](const Gate* g) { return g->get_type ()->has_property (GateTypeProperty::ff); }, false , nullptr , nullptr , &cache);
702
- EXPECT_TRUE (res2.is_ok ());
703
- EXPECT_EQ (res2.get (), std::set<Gate*>({dff2, dff3, sff0, sff1}));
704
- }
705
687
}
706
688
{
707
689
// test NetlistModificationDecorator::get_next_matching_gates_until
0 commit comments