testSplayTree.C

Go to the documentation of this file.

 
/* Aleph-w
 
     / \  | | ___ _ __ | |__      __      __
    / _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
   / ___ \| |  __/ |_) | | | |_____\ V  V /  version 1.9c
  /_/   \_\_|\___| .__/|_| |_|      \_/\_/   https://github.com/lrleon/Aleph-w
                 |_|         
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2018 Leandro Rabindranath Leon 
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
 
  This program is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  General Public License for more details.
 
  You should have received a copy of the GNU General Public License
  along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
# include <cstdlib>
# include <ctime>
# include <iostream>
# include <string>
# include <aleph.H>
# include <tpl_splay_tree.H>
# include <tpl_binNodeUtils.H>
 
using namespace std;
using namespace Aleph;
 
 
static void print(Splay_Tree<int>::Node *p, int, int) 
{
  cout << p->get_key() << " ";
}
 
static int r[] = { 776, 846, 736, 515, 528, 677, 404, 629, 879,  762 };
 
int main(int argc, char *argv[])
{
  int n = 1000;
  unsigned int t = std::time(0);
  int value;
 
  if (argc > 1)
    {
      try
        {
          n = stoi(argv[1]);
        }
      catch (...)
        {
          n = 1000;
        }
    }
 
  if (n <= 0)
    {
      cerr << "Error: n must be a positive integer." << endl;
      return 1;
    }
 
  if (argc > 2)
    {
      try
        {
          t = stoi(argv[2]);
        }
      catch (...)
        {
          t = std::time(0);
        }
    }
 
  srand(t);
 
  cout << "testSplayTree " << n << " " << t << endl;
 
  Splay_Tree<int> tree;
  Splay_Tree<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*10.0*rand()/(RAND_MAX+1.0));
      //      value = r[i];
      node = tree.search(value);
      if (node == NULL)
  {
    insCount++;
    node = new Splay_Tree<int>::Node (value);
    tree.insert(node);
    cout << value << " ";
  }
    }
  cout << endl;
 
  cout << endl << "Preorder " << endl << endl;
  preOrderRec(tree.getRoot(), print);
 
  cout << endl << 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;
}