本文整理汇总了C++中SplayTree::search方法的典型用法代码示例。如果您正苦于以下问题：C++ SplayTree::search方法的具体用法？C++ SplayTree::search怎么用？C++ SplayTree::search使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类SplayTree的用法示例。
在下文中一共展示了SplayTree::search方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(int argn, char *argc[])
{
int n = 1000;
unsigned int t = time(0);
int value;
if (argn > 1)
n = atoi(argc[1]);
if (argn > 2)
t = atoi(argc[2]);
srand(t);
cout << "testSplayTree " << n << " " << t << endl;
SplayTree<int> tree;
SplayTree<int>::Node *node;
int i;
cout << "Inserting " << n << " random values in treee ...\n";
unsigned int insCount = 0, delCount = 0;
for (i = 0; i < n; i++)
{
value = 1+(int) (n*100.0*rand()/(RAND_MAX+1.0));
node = tree.search(value);
if (node == NULL)
{
insCount++;
node = new SplayTree<int>::Node (value);
tree.insert(node);
}
}
cout << insCount << " Items inserted" << endl;
for (i = 0; i < n; i++)
{
value = 1+(int) (n*100.0*rand()/(RAND_MAX+1.0));
node = tree.remove(value);
if (node != NULL)
{
delCount++;
delete node;
}
}
cout << delCount << " Items removed" << endl;
destroyRec(tree.getRoot());
cout << "testSplayTree " << n << " " << t << endl;
}