tensorflow/core/grappler/graph_analyzer/graph_analyzer_test.cc
// Propagate backwards from all-or-none-input node, finding that the
// resulting subgraph would be too large.
Propagate backwards from all-or-none-input node, finding that the
resulting subgraph would be too large.
Propagate backwards from all - or - none - input node finding that the resulting subgraph would be too large .
TEST_F(GraphAnalyzerTest, AllOrNoneInputTooLargeBackwards) {
  gran_ = absl::make_unique<GraphAnalyzer>(graph_all_or_none_, 3);
  Status st = BuildMap();
  ASSERT_THAT(st, Eq(Status::OK()));
  auto root =
      absl::make_unique<Subgraph>(Subgraph::Identity({GetNode("pass2")}));
  ExtendSubgraphAllOrNone(root.get(), GetNode("pass2"));
  EXPECT_THAT(DumpRawSubgraphs(), UnorderedElementsAre());
  EXPECT_THAT(DumpPartials(), UnorderedElementsAre());
  EXPECT_THAT(GetTodo(), SizeIs(0));
}
TEST_F ( GraphAnalyzerTest , AllOrNoneInputTooLargeBackwards ) { gran_ = absl :: make_unique < GraphAnalyzer > ( graph_all_or_none_ , 3 ) ; Status st = BuildMap ( ) ; ASSERT_THAT ( st , Eq ( Status :: OK ( ) ) ) ; auto root = absl :: make_unique < Subgraph > ( Subgraph :: Identity ( { GetNode ( " " ) } ) ) ; ExtendSubgraphAllOrNone ( root . get ( ) , GetNode ( " " ) ) ; EXPECT_THAT ( DumpRawSubgraphs ( ) , UnorderedElementsAre ( ) ) ; EXPECT_THAT ( DumpPartials ( ) , UnorderedElementsAre ( ) ) ; EXPECT_THAT ( GetTodo ( ) , SizeIs ( 0 ) ) ; }
Propagate backwards from all-or-none-input node, finding that the
resulting subgraph would be too large.
Propagate backwards from all - or - none - input node finding that the resulting subgraph would be too large .