writeRankTree.C

Go to the documentation of this file.

 
/*
                          Aleph_w
 
  Data structures & Algorithms
  version 2.0.0b
  https://github.com/lrleon/Aleph-w
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2026 Leandro Rabindranath Leon
 
  Permission is hereby granted, free of charge, to any person obtaining a copy
  of this software and associated documentation files (the "Software"), to deal
  in the Software without restriction, including without limitation the rights
  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  copies of the Software, and to permit persons to whom the Software is
  furnished to do so, subject to the following conditions:
 
  The above copyright notice and this permission notice shall be included in all
  copies or substantial portions of the Software.
 
  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  SOFTWARE.
*/
 
 
# include <iostream>
# include <fstream>
# include <tclap/CmdLine.h>
# include <aleph.H>
# include <tpl_dynArray.H>
# include <tpl_binNodeXt.H>
# include <tpl_binNodeUtils.H>
# include <tpl_binTree.H>
 
using namespace Aleph;
using namespace std;
 
typedef BinNodeXt<int> Node;
 
ofstream output;
 
void print_key(Node* p, int, int)
{
  output << p->get_key() << " ";
}
 
void print_count(Node* p, int, int)
{
  output << p->getCount() << " ";
}
 
void print_tag(Node*, int, int pos)
{
  output << "tag " << pos << " " << pos << " N -15 35" << endl;
}
 
int main(int argc, char* argv[])
{
  try
    {
      TCLAP::CmdLine cmd(
        "Demonstrate ranked BST with subtree counts.\n"
        "Creates a tree where each node stores the size of its subtree.",
        ' ', "1.0");
 
      TCLAP::ValueArg<int> nArg("n", "count",
                                 "Number of elements",
                                 false, 10, "int");
      cmd.add(nArg);
 
      TCLAP::ValueArg<unsigned int> seedArg("s", "seed",
                                             "Random seed (0 = use time)",
                                             false, 0, "unsigned int");
      cmd.add(seedArg);
 
      cmd.parse(argc, argv);
 
      int n = nArg.getValue();
      unsigned int t = seedArg.getValue();
 
      if (t == 0)
        t = time(nullptr);
 
      srand(t);
 
      cout << "=== Ranked BST Demo ===" << endl;
      cout << "Elements: " << n << ", Seed: " << t << endl << endl;
 
      // Open output file
      output.open("rank-tree-aux.Tree", ios::out);
      if (!output.is_open())
        {
          cerr << "Error: cannot open output file" << endl;
          return 1;
        }
 
      // Build ranked tree
      Node* root = Node::NullPtr;
 
      cout << "Building ranked BST..." << endl;
      cout << "Values: ";
      for (int i = 0; i < n; i++)
        {
          int value;
          while (true)
            {
              value = static_cast<int>(10.0 * n * rand() / (RAND_MAX + 1.0));
              if (searchInBinTree(root, value) == Node::NullPtr)
                break;
            }
 
          Node* p = new Node(value);
          insert_by_key_xt(root, p);
          cout << value << " ";
        }
      cout << endl << endl;
 
      assert(check_rank_tree(root));
      assert(check_bst(root));
 
      // Display tree statistics
      cout << "Tree statistics:" << endl;
      cout << "  Total nodes: " << root->getCount() << endl;
      cout << "  Height: " << computeHeightRec(root) << endl;
      cout << "  Root key: " << KEY(root) << endl;
      cout << "  Root count: " << root->getCount() << endl;
 
      // Demonstrate select operations
      cout << endl << "Order statistics (select):" << endl;
      for (int i = 0; i < min(n, 5); i++)
        {
          Node* sel = select(root, i);
          cout << "  Position " << i << ": " << KEY(sel) << endl;
        }
 
      // Write preorder traversal of keys
      preOrderRec(root, &print_key);
 
      // Write auxiliary section with subtree counts
      output << endl << endl << "START-AUX ";
      inOrderRec(root, &print_count);
 
      // Write position tags for visualization
      output << endl << endl << "% Position tags (infix order)" << endl << endl;
      inOrderRec(root, &print_tag);
      output << endl;
 
      output.close();
 
      cout << endl << "Generated file:" << endl;
      cout << "  - rank-tree-aux.Tree (with subtree counts and position tags)" << endl;
 
      destroyRec(root);
    }
  catch (TCLAP::ArgException& e)
    {
      cerr << "Error: " << e.error() << " for arg " << e.argId() << endl;
      return 1;
    }
 
  return 0;
}