BFLAnsysLookup.cxx

Go to the documentation of this file.

//
//  Author: Costas Andreopoulos
//  Last revision: March 8, 2001
//
//  (c) 2001 University of Athens

#include <cstdlib>
#include <fstream>
#include "TObjArray.h"

#include "MessageService/MsgService.h"
#include "BField/BFLAnsysLookup.h"

ClassImp(BFLAnsysLookup)

//_____________________________________________________________________
BFLAnsysLookup::BFLAnsysLookup()
   : BFLLookupTable()
{

}
//_____________________________________________________________________
BFLAnsysLookup::BFLAnsysLookup(BfldGrid::Grid_t grid)
   : BFLLookupTable(grid)
{

   switch(grid) {
   case BfldGrid::kNearCoarseV: 
       fLookupFilename = "NearDetANSYSLookup.default"; // tmp - hardcoded
       LoadLookupTable(fLookupFilename);
       break;
   default:
      // MSG("BFL",Msg::kWarning)
      //    << "Lookup table not yet supported for grid " <<
      //    BfldGrid::AsString(grid) << endl;
       break;
   }

}
//_____________________________________________________________________
BFLAnsysLookup::~BFLAnsysLookup()
{
   fGrid = BfldGrid::kUndefined;   
   if(fTable) fTable->Delete();
   delete fTable;
}
//_____________________________________________________________________
void BFLAnsysLookup::FindNode(Int_t node, TObjArray * result)
{
// return all lookup table entries where Node ID = node
//
  TIter next(fTable);
  BFLNode2ACell * entry;
  while( (entry = (BFLNode2ACell*)next()) ){
     if( entry->GetNodeID() == node ) result->Add(entry->Clone());
  }
} 
//_____________________________________________________________________
void BFLAnsysLookup::FindCell(Int_t cell, TObjArray * result)
{
// return all lookup table entries where Cell ID = cell
//
  TIter next(fTable);
  BFLNode2ACell * entry;
  while( (entry = (BFLNode2ACell*)next()) ){
     if( entry->GetCellID() == cell ) result->Add(entry->Clone());
  }
} 
//_____________________________________________________________________
void BFLAnsysLookup::LoadLookupTable(TString filename)
{
   Int_t CellID = -1, Node1 = -1, Node2 = -1, Node3 = -1, Node4 = -1,  i = 0;
   Int_t nodes[kNMaxNodesPerACell] = { 0, 1, 2, 3};

   ifstream LOOKUP(filename,ios::in);
   if(!LOOKUP) {
      cerr << "BFLAnsysLookup::LoadLookupTable : No such file as " << filename << endl;
      exit(1);
   }

   // --- lookup table has a very simple (repetitive) structure
   while(!LOOKUP.eof()) {
      LOOKUP >> CellID >> Node1 >> Node2 >> Node3 >> Node4;

      // again -> this structure of the lookup table makes searching easier
      fTable->AddAtAndExpand( new BFLNode2ACell(CellID,Node1,nodes), i++);
      fTable->AddAtAndExpand( new BFLNode2ACell(CellID,Node2,nodes), i++);
      fTable->AddAtAndExpand( new BFLNode2ACell(CellID,Node3,nodes), i++);
      fTable->AddAtAndExpand( new BFLNode2ACell(CellID,Node4,nodes), i++);
   }
   fTable->Sort();
}
//_____________________________________________________________________

---