doctree.hh

Go to the documentation of this file.

#ifndef __DOCTREE_HH__
#define __DOCTREE_HH__
 
#include "lout/misc.hh"
 
class DoctreeNode {
   public:
      DoctreeNode *parent;
      DoctreeNode *sibling;
      DoctreeNode *lastChild;
      int num; // unique ascending id
      int element;
      lout::misc::SimpleVector<char*> *klass;
      const char *pseudo;
      const char *id;
 
      DoctreeNode () {
         parent = NULL;
         sibling = NULL;
         lastChild = NULL;
         klass = NULL;
         pseudo = NULL;
         id = NULL;
         element = 0;
      };
 
      ~DoctreeNode () {
         dFree ((void*) id);
         while (lastChild) {
            DoctreeNode *n = lastChild;
            lastChild = lastChild->sibling;
            delete n;
         }
         if (klass) {
            for (int i = 0; i < klass->size (); i++)
               dFree (klass->get(i));
            delete klass;
         }
      }
};
 
class Doctree {
   private:
      DoctreeNode *topNode;
      DoctreeNode *rootNode;
      int num;
 
   public:
      Doctree () {
         rootNode = new DoctreeNode;
         topNode = rootNode;
         num = 0;
      };
 
      ~Doctree () {
         delete rootNode;
      };
 
      DoctreeNode *push () {
         DoctreeNode *dn = new DoctreeNode ();
         dn->parent = topNode;
         dn->sibling = dn->parent->lastChild;
         dn->parent->lastChild = dn;
         dn->num = num++;
         topNode = dn;
         return dn;
      };
 
      void pop () {
         assert (topNode != rootNode); // never pop the root node
         topNode = topNode->parent;
      };
 
      inline DoctreeNode *top () {
         if (topNode != rootNode)
            return topNode;
         else
            return NULL;
      };
 
      inline DoctreeNode *parent (const DoctreeNode *node) {
         if (node->parent != rootNode)
            return node->parent;
         else
            return NULL;
      };
 
      inline DoctreeNode *sibling (const DoctreeNode *node) {
         return node->sibling;
      };
};
 
#endif