writeSplay.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 <fstream>
# include <string>
# include <aleph.H>
# include <tpl_splay_tree.H>
# include <tpl_binNodeUtils.H>
 
using namespace Aleph;
using namespace std;
 
 
ofstream output("splay-tree-aux.Tree", ios::out);
 
void print_key(Splay_Tree<int>::Node * p, int, int)
{
  output << p->get_key() << " ";
}
 
int main(int argc, char *argv[])
{
  int n = 1000;
  if (argc > 1)
    {
      try { n = stoi(argv[1]); } catch (...) { n = 1000; }
    }
 
  if (n <= 0)
    {
      cerr << "n must be positive" << endl;
      return 1;
    }
 
  unsigned int t = std::time(0);
  if (argc > 2)
    {
      try { t = stoul(argv[2]); } catch (...) { t = std::time(0); }
    }
 
  srand(t);
 
  cout << "writeSplay " << n << " " << t << endl;
 
  Splay_Tree<int> tree;
  Splay_Tree<int>::Node *node;
  int i, value;
 
  cout << "Inserting " << n << " random values in tree ...\n";
 
  for (i = 0; i < n; i++)
    {
      while (true)
  {
    value = 1+ static_cast<int> (n * 1.0 * rand () / (RAND_MAX + 1.0));
    node = tree.search(value);
    if (node == nullptr)
      break;
  }
      node = new Splay_Tree<int>::Node (value);
      tree.insert(node);
    }
 
  preOrderRec(tree.getRoot(), print_key);
 
  destroyRec(tree.getRoot());
}