Gabriele Cosmo
107 lines
3.8 KiB
C++
107 lines
3.8 KiB
C++
//
|
|
// ********************************************************************
|
|
// * DISCLAIMER *
|
|
// * *
|
|
// * The following disclaimer summarizes all the specific disclaimers *
|
|
// * of contributors to this software. The specific disclaimers,which *
|
|
// * govern, are listed with their locations in: *
|
|
// * http://cern.ch/geant4/license *
|
|
// * *
|
|
// * Neither the authors of this software system, nor their employing *
|
|
// * institutes,nor the agencies providing financial support for this *
|
|
// * work make any representation or warranty, express or implied, *
|
|
// * regarding this software system or assume any liability for its *
|
|
// * use. *
|
|
// * *
|
|
// * This code implementation is the intellectual property of the *
|
|
// * GEANT4 collaboration. *
|
|
// * By copying, distributing or modifying the Program (or any work *
|
|
// * based on the Program) you indicate your acceptance of this *
|
|
// * statement, and all its terms. *
|
|
// ********************************************************************
|
|
//
|
|
//
|
|
// $Id: G4GeoNav.hh,v 1.2 2002/06/04 09:23:45 gcosmo Exp $
|
|
// GEANT4 tag $Name: geant4-05-00 $
|
|
//
|
|
//
|
|
// --------------------------------------------------------------
|
|
// G4GeoNav
|
|
//
|
|
// Author: Martin Liendl - Martin.Liendl@cern.ch
|
|
//
|
|
// --------------------------------------------------------------
|
|
//
|
|
#ifndef G4GeoNav_h
|
|
#define G4GeoNav_h
|
|
|
|
#include "G4String.hh"
|
|
#include "g4std/vector"
|
|
#include <regex.h>
|
|
|
|
#include "G4RotationMatrix.hh"
|
|
#include "G4ThreeVector.hh"
|
|
#include "G4LogicalVolume.hh"
|
|
#include "G4VisAttributes.hh"
|
|
|
|
#include "tree.hh"
|
|
|
|
class G4VPhysicalVolume;
|
|
class OlapDetConstr;
|
|
|
|
// qt-free version of G4GeoNav
|
|
|
|
typedef Tree<G4LogicalVolume*> LVTree;
|
|
|
|
class G4GeoNav
|
|
{
|
|
|
|
public:
|
|
G4GeoNav( G4LogicalVolume * root );
|
|
~G4GeoNav();
|
|
G4LogicalVolume * GetLV() { return theCurLV->data(); }
|
|
|
|
// get next logical volume which name matches aRegExp
|
|
//G4LogicalVolume * NextLV(const G4String & aRegExp);
|
|
|
|
// returns a vector of LogicalVolumes which names match the aRegExp
|
|
G4int FilterLV(const G4String & aRegExp,
|
|
G4std::vector<G4LogicalVolume*> & result,
|
|
G4bool stopAtFirst=false);
|
|
// returns a vector of LogicalVolumes reflecting the hierarchy of theCurLVItem
|
|
G4int PathLV(G4std::vector<G4LogicalVolume*> & result);
|
|
// "cd /CMS/Tr.*/.*Barrel"
|
|
G4LogicalVolume * ChangeLV(const G4String & aRegExp);
|
|
// get next lv as seen from the current one
|
|
G4LogicalVolume * NextLV();
|
|
// "pwd"
|
|
G4int PwdLV(G4std::vector<G4LogicalVolume *>&);
|
|
// "ls"
|
|
G4int LsLV(G4std::vector<G4LogicalVolume *>&);
|
|
// theSubreeLVItem = theCurLVItem
|
|
//void CurLVToSubtree() {theSubtreeLVItem = theCurLVItem;};
|
|
//OlapDetConstr * GetDetConstr();
|
|
const LVTree::node_t & root() const { return *(theLVTree->root()); }
|
|
|
|
protected:
|
|
|
|
void RecursiveFill(LVTree::node_t*);
|
|
|
|
void CountSubtreeNodes(LVTree::node_t*,G4int&);
|
|
// recursive counting of nodes
|
|
|
|
G4int Tokenize(const G4String &, G4std::vector<G4String>&);
|
|
|
|
void FindLV(regex_t *, LVTree::node_t * ,
|
|
G4std::vector<G4LogicalVolume*>&, G4bool stopAtFirst=false) ;
|
|
|
|
void populateLVTree(LVTree::node_t*); // recursive population of LV-Tree
|
|
|
|
LVTree * theLVTree ;
|
|
LVTree::node_t * theCurLV; // used in the NewWorld
|
|
LVTree::node_t * theRootLV; // root of the 'whole' geometry
|
|
LVTree::node_t * theSubtreeEndLVItem; // (un)used ...
|
|
};
|
|
|
|
#endif
|