Testing if add node successfully.
Testing initialized container's size.
73 {
74
76
78
79 m_Nodes.push_back({ "A", {"C"}, std::bind((void(directed_acyclic_graphFuncTest::*)()) & directed_acyclic_graphFuncTest::Test, &funcTestClass)});
80 m_Nodes.push_back({ "B", {"A"}, std::bind((void(directed_acyclic_graphFuncTest::*)(float)) & directed_acyclic_graphFuncTest::Test, &funcTestClass, 1.0f)});
81 m_Nodes.push_back({ "C", {}, std::bind(&directed_acyclic_graphFuncTest::Test1)});
82
83 for (int i = 0; i < m_Nodes.size(); i++)
84 {
85 m_DAG.add_node(&m_Nodes[i]);
86 }
87
91 EXPECT_EQ(m_Nodes.size(), 3);
92 EXPECT_EQ(m_DAG.size(), 3);
93 }
#define SPICESTEST_PROFILE_FUNCTION()