Searched refs:invalid_input (Results 1 – 7 of 7) sorted by relevance
29 invalid_input="3 4 5 6 7 8 a abcefg x1999 xffff -1 -0000042 check_input "${invalid_input}" invalid $test_file
31 invalid_input="3 4 5 6 7 8 a abcefg x1999 xffff -1 -0000043 check_input "${invalid_input}" invalid $test_file
31 invalid_input="3 4 5 6 7 8 a abcefg x1999 xffff -1 -0000044 check_input "${invalid_input}" invalid $test_file
246 for (const std::pair<string, string>& invalid_input : invalid_inputs) { in SummarizeGraph() local247 std::cout << "Invalid input " << invalid_input.second << " for node " in SummarizeGraph()248 << invalid_input.first << std::endl; in SummarizeGraph()
737 for (const std::pair<string, string>& invalid_input : invalid_inputs) { in TestFindInvalidInputs() local738 EXPECT_TRUE((invalid_input.first == "add_node1") || in TestFindInvalidInputs()739 (invalid_input.first == "add_node2")); in TestFindInvalidInputs()740 if (invalid_input.first == "add_node1") { in TestFindInvalidInputs()741 EXPECT_TRUE((invalid_input.second == "missing_input1") || in TestFindInvalidInputs()742 (invalid_input.second == "missing_input2")) in TestFindInvalidInputs()743 << invalid_input.second; in TestFindInvalidInputs()744 } else if (invalid_input.first == "add_node2") { in TestFindInvalidInputs()745 EXPECT_EQ("missing_input3", invalid_input.second); in TestFindInvalidInputs()
578 for (const std::pair<string, string>& invalid_input : invalid_inputs) { in IsGraphValid() local579 LOG(ERROR) << "Invalid input " << invalid_input.second << " for node " in IsGraphValid()580 << invalid_input.first << " - " in IsGraphValid()581 << node_map[invalid_input.first]->DebugString(); in IsGraphValid()
1311 for (auto* invalid_input : cases) { in TEST_F() local1313 invalid_input); in TEST_F()