BFLNode2ACell.h

Go to the documentation of this file.

//
// BFLNode2ACell
//
// A simple object to serve as an entry at the ANSYS <-> Voronoi 
// lookup table. Essentially it holds
//     Ansys Node -- Ansys Cell -- List of the rest cell nodes
// for each Ansys Node
// One could argue that there is a certain redundancy in this approach.
// Well, there is but at the same time it makes 'searching' more 
// efficient
//
// Author: C.Andreopoulos, March 5, 2001
// (c) 2001 - University of Athens 
//

#ifndef BFLNODE2ACELL_H
#define BFLNODE2ACELL_H

#include <iostream>
using std::cout;
using std::endl;

#include "TString.h"
#include "TObject.h"

const Int_t kNMaxNodesPerACell = 4;

//_________________________________________________________________________  
class BFLNode2ACell: public TObject {

  public:
    
    BFLNode2ACell() { }
    BFLNode2ACell(Int_t cell, Int_t node, Int_t nodeslist[kNMaxNodesPerACell]):
      fANSYSCellID(cell),fANSYSNodeID(node) { *fCellNodes=*nodeslist; }
    virtual ~BFLNode2ACell() { }

    virtual void SetCellID(Int_t cell)       { fANSYSCellID = cell; } 
    virtual void SetNodeID(Int_t node)       { fANSYSNodeID = node; }  
    virtual void SetCellNodes(Int_t nodes[kNMaxNodesPerACell]) {*fCellNodes = *nodes; }

    virtual Int_t  GetCellID(void)           { return fANSYSCellID; }
    virtual Int_t  GetNodeID(void)           { return fANSYSNodeID; }
    virtual void   GetCellNodes(Int_t nodes[kNMaxNodesPerACell]) {
        Int_t i = 0;
        while(i<kNMaxNodesPerACell) {
            nodes[i] = fCellNodes[i];
            i++;
        }
    }

    virtual void Print(Option_t *) const {
      cout << "Cell-> " << fANSYSCellID << endl; 
      Int_t i = 0;
      cout << "List of nodes in this cell " << endl;
      while(i < kNMaxNodesPerACell && fCellNodes[i] != -1) {
         cout << fCellNodes[i] << endl;
         i++;
      }
    }
    virtual Bool_t IsSortable() const { return kTRUE; }

    virtual Bool_t IsEqual(const TObject *obj) const {  // soft by nodes
      return fANSYSNodeID == ((BFLNode2ACell*)obj)->GetNodeID();
    }
   Int_t Compare(const TObject *obj) const {
     if ( fANSYSCellID == ((BFLNode2ACell*)obj)->GetCellID() )
        return 0;
     else if (fANSYSCellID < ((BFLNode2ACell*)obj)->GetCellID() )
        return -1;
     else
        return 1; 
   }

  private:

    Int_t fANSYSCellID;
    Int_t fANSYSNodeID;
    Int_t fCellNodes[kNMaxNodesPerACell];

    ClassDef(BFLNode2ACell,0) // ANSYS Nodes <-> ANSYS Cells table entry
};  

#endif

---