legoTree.H

Go to the documentation of this file.

/*-------------------------------------------------------------------
 *   Name:        legoTree.H
 *
 *   Designer:    Bill Havanki
 *
 *   Created:     10/30/96 (Happy Halloween everybody)
 *
 *   Description: This file contains the LEGO header file which
 *                defines the treegion derived class.
 *
 *   Location:    /ncsu/tinker/LEGO/src/derived/legoTree.H
 --------------------------------------------------------------------
 * 10/30/96 WAH: Initial file creation.
 * 11/01/96 WAH: Added support for treegion children. 
 * 11/22/96 WAH: Incorporated in LEGO proper.
 * 2/13/97 WAH:  Made name change from legoRegionRef to regionList et al.
 * 3/22/97 WAH:  Added RefreshEdges method et al.
 * 6/11/97 WAH:  Added GetOpCount method.
 * 1/29/98 WAH:  Modified RefreshEntryEdges to delete parents list.
 * 3/27/98 WAH:  Fixed RefreshEntryEdges to handle root with no inedges.
 --------------------------------------------------------------------*/

#ifndef LEGOTREEGION_H
#define LEGOTREEGION_H

#include <stdio.h>
#include "region.H"

//---------------------------------------------------------------------------

class legoTreegion : public legoRegion
{
  legoRegion *root;
  regionList *saplings;
  regionList *treeTraversalRList;

  //  void AddExitOp (legoOp *);
  //  regionList *DFS (legoRegion *, int);

public:
  legoTreegion () : legoRegion (RT_TREE,0) {
    root = NULL;
    saplings = NULL;
    treeTraversalRList = NULL; 
  }
  legoTreegion (unsigned rId = 0): legoRegion(RT_TREE,rId) {
    root = NULL;
    saplings = NULL;
    treeTraversalRList = NULL; 
  }
  legoTreegion (const legoTreegion &orig) : legoRegion ((legoRegion) orig)
  {
    root = (legoRegion *) GetItem(0);
    RefreshSaplings();
    treeTraversalRList = NULL; 
  }

  ~legoTreegion () {
    delete saplings;
    delete treeTraversalRList;
    RegionKiller();
  }
  int GetOpCount (void)
  {
    int opct = 0;

    for (int i = 0; i < GetCount(); i++)
      opct += ((legoRegion *) GetItem(i))->GetOpCount();
    return opct;
  }

  void SetRoot (legoRegion *r) {root = r;}
  legoRegion *GetRoot (void) {return root;}

  void SetSaplings (regionList *r) {saplings = r;}
  regionList *GetSaplings (void) {return saplings;}

  void RefreshSaplings (void);

  void SetTreeTraversalRList (regionList *r) {treeTraversalRList = r;}
  regionList *GetTreeTraversalRList (void) {return treeTraversalRList;}

  void RefreshOps (void)
  {
    RefreshEntryOps();
    RefreshExitOps();
  } // end RefreshOps
  void RefreshEntryOps (void)
  {
    if (GetEntryOpsPtr() != NULL)
      delete GetEntryOpsPtr();  // scrog old list
    SetEntryOpsPtr (new opList (*(root->GetEntryOpsPtr())));
  } // end RefreshEntryOps
  void RefreshExitOps();

  void RefreshEdges (void)
  {
    RefreshEntryEdges();
    RefreshExitEdges();
  } // end RefreshEdges
  void RefreshEntryEdges (void)
  {
    if (GetInEdgesPtr() != NULL)
      delete GetInEdgesPtr();  // scrog old list
    if (root->GetInEdgesPtr() != NULL)
      SetInEdgesPtr (new edgeList (*(root->GetInEdgesPtr())));
    else
      SetInEdgesPtr (NULL);
    SetParents (NULL);
  } // end RefreshEntryEdges
  void RefreshExitEdges (void);

/* #define LEGOTREE_FULL (0) */
/* #define LEGOTREE_LINEAR (1) */

  /*  void Construct (legoRegion *, int = LEGOTREE_FULL);
  void ContinueConstruction (void);
  void Deconstruct (void);
  void Reconstruct (legoRegion *);*/
  void Dump (FILE *);
};
#endif // LEGOTREEGION_H

---