本文整理汇总了C++中DoubleLinkedList::InsertBefore方法的典型用法代码示例。如果您正苦于以下问题：C++ DoubleLinkedList::InsertBefore方法的具体用法？C++ DoubleLinkedList::InsertBefore怎么用？C++ DoubleLinkedList::InsertBefore使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类DoubleLinkedList的用法示例。
在下文中一共展示了DoubleLinkedList::InsertBefore方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: TestInsertBefore
void TestInsertBefore()
{
DoubleLinkedList<int> clist;
std::cout << "\n********** Testing: DoubleLinkedList InsertBefore **********" << std::endl;
std::cout << "\n********** Testing: InsertBefore with Empty List **********" << std::endl;
try
{
//Note: Here is the function signature so you can determine the order of parameters
//void DoubleLinkedList<T>::InsertBefore(const T & new_data, const T & existing_data)
clist.InsertBefore(-1, 0);
}
catch(const char * msg)
{
std::cout << msg << std::endl;
}
std::cout << "\n********** Testing: InsertBefore head with only one node **********" << std::endl;
clist.Append(0);
clist.InsertBefore(-1, 0);
std::cout << clist.First() << std::endl;
std::cout << clist.Last() << std::endl;
std::cout << "\n********** Testing: InsertBefore head with multiple nodes **********" << std::endl;
clist.InsertBefore(-3, -1);
std::cout << clist.First() << std::endl;
std::cout << clist.Last() << std::endl;
std::cout << "\n********** Testing: InsertBefore a node in the middle of the list **********" << std::endl;
clist.InsertBefore(-2, -1);
std::cout << clist.First() << std::endl;
std::cout << clist.Last() << std::endl;
std::cout << "\n********** Testing: InsertBefore but existing_data doesn't exist **********" << std::endl;
try
{
clist.InsertBefore(-2, 99);
}
catch (const char * msg)
{
std::cout << msg << std::endl;
}
}示例2: TestInsertBefore
void TestInsertBefore()
{
DoubleLinkedList<int> clist;
std::cout << "\n********** InsertBefore **********" << std::endl;
// Empty List
try
{
clist.InsertBefore(-1, 0);
}
catch (char * msg)
{
std::cout << msg << std::endl;
}
// Head and Tail are the same
clist.Append(0);
clist.InsertBefore(-1, 0);
std::cout << clist.First() << std::endl;
std::cout << clist.Last() << std::endl;
// Before Head
clist.InsertBefore(-3, -1);
std::cout << clist.First() << std::endl;
std::cout << clist.Last() << std::endl;
// Middle
clist.InsertBefore(-2, -1);
std::cout << clist.First() << std::endl;
std::cout << clist.Last() << std::endl;
// Node doesn't exist
try
{
clist.InsertBefore(-2, 99);
}
catch (char * msg)
{
std::cout << msg << std::endl;
}
}