lars/geant4
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Import Geant4 9.0.0 source tree

Browse Source
This commit is contained in:
Gabriele Cosmo
2016-06-09 15:16:48 +02:00
parent 75c7fd177d
commit a8e9364cea
6592 changed files with 84274 additions and 69292 deletions
Download Patch File Download Diff File Expand all files Collapse all files
source/visualization/Tree/include/G4ASCIITree.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4ASCIITree.hh,v 1.7 2006/06/29 21:24:27 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001
source/visualization/Tree/include/G4ASCIITreeMessenger.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4ASCIITreeMessenger.hh,v 1.7 2006/06/29 21:24:29 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001
source/visualization/Tree/include/G4ASCIITreeSceneHandler.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4ASCIITreeSceneHandler.hh,v 1.17 2006/12/11 21:14:45 allison Exp $
// GEANT4 tag $Name: geant4-08-03 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001
source/visualization/Tree/include/G4ASCIITreeViewer.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4ASCIITreeViewer.hh,v 1.5 2006/06/29 21:24:33 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001
source/visualization/Tree/include/G4GAGTree.hh
-50
View File
@@ -1,50 +0,0 @@
//
// ********************************************************************
// * License and Disclaimer *
// * *
// * The Geant4 software is copyright of the Copyright Holders of *
// * the Geant4 Collaboration. It is provided under the terms and *
// * conditions of the Geant4 Software License, included in the file *
// * LICENSE and available at http://cern.ch/geant4/license . These *
// * include a list of copyright holders. *
// * *
// * 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. Please see the license in the file LICENSE and URL above *
// * for the full disclaimer and the limitation of liability. *
// * *
// * This code implementation is the result of the scientific and *
// * technical work of the GEANT4 collaboration. *
// * By using, copying, modifying or distributing the software (or *
// * any work based on the software) you agree to acknowledge its *
// * use in resulting scientific publications, and indicate your *
// * acceptance of all terms of the Geant4 Software license. *
// ********************************************************************
//
// Satoshi Tanaka 31 May 2001
// A graphics system to dump geometry hierarchy to GAG.
//
#ifndef G4GAGTREE_HH
#define G4GAGTREE_HH
#include "G4VTree.hh"
class G4GAGTreeMessenger;
class G4GAGTree: public G4VTree {
public:
G4GAGTree ();
virtual ~G4GAGTree ();
G4VSceneHandler* CreateSceneHandler (const G4String& name = "");
G4VViewer* CreateViewer (G4VSceneHandler&, const G4String& name = "");
void SetVerbosity(G4int verbosity) {fVerbosity = verbosity;}
G4int GetVerbosity() const {return fVerbosity;}
protected:
G4int fVerbosity;
G4GAGTreeMessenger* fpMessenger;
};
#endif
source/visualization/Tree/include/G4GAGTreeList.hh
-395
View File
@@ -1,395 +0,0 @@
//
// ********************************************************************
// * License and Disclaimer *
// * *
// * The Geant4 software is copyright of the Copyright Holders of *
// * the Geant4 Collaboration. It is provided under the terms and *
// * conditions of the Geant4 Software License, included in the file *
// * LICENSE and available at http://cern.ch/geant4/license . These *
// * include a list of copyright holders. *
// * *
// * 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. Please see the license in the file LICENSE and URL above *
// * for the full disclaimer and the limitation of liability. *
// * *
// * This code implementation is the result of the scientific and *
// * technical work of the GEANT4 collaboration. *
// * By using, copying, modifying or distributing the software (or *
// * any work based on the software) you agree to acknowledge its *
// * use in resulting scientific publications, and indicate your *
// * acceptance of all terms of the Geant4 Software license. *
// ********************************************************************
//
//////////////////////////////////
///// G4GAGTreeList.hh ///////
///// Satoshi Tanaka ///////
//////////////////////////////////
#if !defined G4GAGTREELIST_HH
#define G4GAGTREELIST_HH
#include <iostream>
#include "globals.hh"
/////////////////////////////////
///// class G4GAGTreeNode /////
/////////////////////////////////
template <class Type> class G4GAGTreeNode {
public:
Type item ; // item
G4GAGTreeNode<Type>* down ; // address of neighboring node (downward)
G4GAGTreeNode<Type>* up ; // address of neighboring node (upward)
} ; // G4GAGTreeNode
///////////////////////////////////////
///// class G4GAGTreeList<Type> /////
///////////////////////////////////////
template <class Type> class G4GAGTreeList {
private:
//----- constants
enum { ERROR = 0, NORMAL = 1 };
G4GAGTreeNode<Type>* head ; // head of list
G4GAGTreeNode<Type>* tail ; // tail of list
G4GAGTreeNode<Type>* cur ; // current node
//----- number of items in list
int nItem ; // number of stored items
public:
//----- Constructor
//..... Initialize head and current node of list to NULL.
//..... Set name of list ( default name is "no_name")
G4GAGTreeList( const char* name_ = "no_name" ) ;
//----- Destructor
~G4GAGTreeList() { this->Clear() ; }
//----- Add an item to list and make it a new head.
//..... Return: NORMAL = 1 (normal)
//..... ERROOR = 0 (error)
int AddItem( const Type& item );
//----- Delete an item of current node
//..... Return: NORMAL = 1 if deleted.
//..... ERROR = 0 if not deleted ( cur = NULL or nItem = 1).
//..... In case of NORMAL, cur moves to cur->down.
int DeleteItem() ;
//----- Set current node to the head of list.
void ToHead() { cur = head ; }
//----- Set current node to the tail of list.
void ToTail() { cur = tail ; }
//----- Increment current node to downward direction by 1 step
//..... Return: NORMAL = 1 (normal)
//..... ERROOR = 0 (if cur = NULL)
int Downward();
//----- Increment current node to upward direction by 1 step
//..... Return: NORMAL = 1 (normal)
//..... ERROOR = 0 (if cur = NULL)
int Upward();
//----- Get current item
//..... The obtained item is returned to the argument.
//..... Return: NORMAL = 1 (normal)
//..... ERROR = 0 (error)
int GetItem( Type& item );
//----- Get position of current node counting from tail
//..... Return: 0, 1, 2, ..... , nItem -1
//..... If cur == tail, 0 is returned.
//..... If cur == NULL, -1 is returned.
//..... Current node is not modified after calling this function
int WhereIsCurrentNode() ;
//----- Check if current node is NULL
//..... Return 1: if cur == NULL
//..... 0: if cur != NULL
int IsCurrentNodeNull() { return ( cur == NULL ) ; }
//----- Get number of stored items
int GetNumItem() const { return nItem ; }
//----- Get number of stored items minus one
//..... Note: If the list is empty, -1 is returned
int GetHeadIndex() const { return (nItem - 1) ; }
//----- delete all items
//..... All nodes are deleted.
//..... head, tail, cur are reset to NULL.
void Clear();
//----- For use of STACK: Push
//..... Added new node becomes a new current node.
//..... Return: NORMAL = 1 (normal)
//..... ERROOR = 0 (error)
//..... Added new node becomes a new current node.
int Push( const Type& item ) { return AddItem( item ) ; }
//----- For use of STACK
//..... Get head->item and then delete it.
//..... The obtained item is returned to the argument.
//..... Return: NORMAL = 1 (normal)
//..... ERROR = 0 (error)
//..... In case of NORMAL, cur moves to cur->down.
int Pop( Type& item ) ;
//----- For use of STACK: pop
void Pop( void ) { this->ToHead(); this->DeleteItem(); }
} ; // class G4GAGTreeList
////////////////////////////////////////////////////////////////
///// Inline Member functions of class "G4GAGTreeList" ///////
////////////////////////////////////////////////////////////////
//-----
template <class Type>
inline G4GAGTreeList<Type>::G4GAGTreeList( const char* )
{
cur = head = tail = NULL ;
nItem = 0 ;
} // G4GAGTreeList<Type>::G4GAGTreeList()
//-----
template <class Type>
inline int G4GAGTreeList<Type>::AddItem( const Type& item )
{
//----- local
int status ;
G4GAGTreeNode<Type>* old_head = head ; // store old head
//----- allocate dynamical memory for added node
head = new G4GAGTreeNode<Type> ;
if( !head ){
//----- failed to allocate dynamical memory
status = ERROR ;
} else {
//----- increment number of stored items
nItem++ ;
//----- set tail of list in the first push
if( nItem == 1 ) { tail = head ; }
//----- set current node to added node
cur = head ;
//----- add an item
head->item = item ; // add an item
//----- make links
//..... 2 1
//..... NULL <----- head -----> old_head
//..... <-----
//..... 3
head->down = old_head ; // make link 1
head->up = NULL ; // make link 2
if( old_head != NULL ) {
old_head->up = head ; // make link 3
}
//----- set status
status = NORMAL ;
} // if--else
//----- return status
return status ;
}
//-----
template <class Type>
inline int G4GAGTreeList<Type>::DeleteItem()
{
//----- local variables
int status ;
G4GAGTreeNode<Type>* cur_old ; // backup of current node
//----- ERROR if current node does not have an item
//...... or no item exist in list
if ( cur == NULL || nItem == 0 ) {
status = ERROR ;
} else {
//----- Below cur != NULL, nItem >= 1,
//..... head != NULL, and tail != NULL
//----- make backup of current node
cur_old = cur ;
//----- remake links
if( cur == head ) {
cur = cur->down ;
head = cur ;
if ( head != NULL ) {
head->up = NULL ;
delete cur_old ; nItem-- ;
} else {
//----- In case that head = NULL:
//..... This case occurs in case that
//..... head = tail i.e. nItem = 1.
//..... At the end of this function,
//..... head = tail = cur = NULL, nItem = 0
tail = NULL ;
delete cur_old ;
nItem = 0 ;
// nItem-- ;
}
} else if( cur == tail ){
//----- Here, cur != head && cur == tail.
//..... So, tail != head.
//..... It means, at least 2 items exist in the list.
//..... So, tail->up is not NULL.
tail = tail->up ;
tail->down = NULL;
cur = NULL ;
delete cur_old ; nItem-- ;
} else { //----- In case that cur is neither head or tail.
//..... head --- .... --- cur ---... --- tail.
(cur->up)->down = cur->down ;
(cur->down)->up = cur->up ;
cur = cur->down ;
delete cur_old ; nItem-- ;
} // if-else_if-else
status = NORMAL;
} // if--else
//----- return (successfully deleted)
return status ;
}
//-----
template <class Type>
inline int G4GAGTreeList<Type>::Downward()
{
int status ;
if( cur == NULL ) {
status = ERROR ; // do nothing
} else {
cur = cur->down ; // move dawnward
status = NORMAL ;
}
return status ;
}
//-----
template <class Type>
inline int G4GAGTreeList<Type>::Upward()
{
int status ;
if( cur == NULL ) {
status = ERROR ; // do nothing
} else {
cur = cur->up ; // move upward
status = NORMAL ;
}
return status ;
}
//-----
template <class Type>
inline int G4GAGTreeList<Type>::GetItem( Type& item )
{
//----- return value
int state ;
//----- get an item of current node
if ( cur == NULL ) {
state = ERROR ;
} else {
state = NORMAL ;
item = cur->item ;
}
//----- return
return state ;
}
//-----
template <class Type>
inline int G4GAGTreeList<Type>::WhereIsCurrentNode()
{
G4GAGTreeNode<Type>* tmp = cur ;// copy current node
int n = -1 ; // counter
//----- count how many steps there are until tail.
while( tmp != NULL ) { n++ ; tmp = tmp->down ;}
//----- return steps
return n ;
}
//-----
template <class Type>
inline void G4GAGTreeList<Type>::Clear()
{
//----- delete items
cur = head ;
while( cur != NULL )
{
G4GAGTreeNode<Type>* tmp = cur ;
cur = cur->down ;
delete tmp ; // destructor called
}
//----- reset head and current node
cur = head = tail = NULL ;
//----- reset number of stored items
nItem = 0 ;
}
//----- Pop()
template <class Type>
inline int G4GAGTreeList<Type>::Pop( Type& item )
{
//----- local variables
int status ;
//----- get head->item
ToHead() ;
status = GetItem( item ) ;
//----- delete head->item if it exists
//..... and make cur move to cur->down
if( status ) { DeleteItem(); }
//----- RETURN
return status ;
}
//////////////
#endif
////////////// end of list.h
source/visualization/Tree/include/G4GAGTreeMessenger.hh
-52
View File
@@ -1,52 +0,0 @@
//
// ********************************************************************
// * License and Disclaimer *
// * *
// * The Geant4 software is copyright of the Copyright Holders of *
// * the Geant4 Collaboration. It is provided under the terms and *
// * conditions of the Geant4 Software License, included in the file *
// * LICENSE and available at http://cern.ch/geant4/license . These *
// * include a list of copyright holders. *
// * *
// * 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. Please see the license in the file LICENSE and URL above *
// * for the full disclaimer and the limitation of liability. *
// * *
// * This code implementation is the result of the scientific and *
// * technical work of the GEANT4 collaboration. *
// * By using, copying, modifying or distributing the software (or *
// * any work based on the software) you agree to acknowledge its *
// * use in resulting scientific publications, and indicate your *
// * acceptance of all terms of the Geant4 Software license. *
// ********************************************************************
//
// Satoshi Tanaka 31th May 2001
//
// A messenger for G4GAGTree driver.
#ifndef G4GAGTREEMESSENGER_HH
#define G4GAGTREEMESSENGER_HH
#include "G4UImessenger.hh"
class G4UIcommand;
class G4UIcmdWithAnInteger;
class G4GAGTree;
class G4GAGTreeMessenger: public G4UImessenger {
public:
G4GAGTreeMessenger(G4GAGTree*);
virtual ~G4GAGTreeMessenger();
G4String GetCurrentValue (G4UIcommand* command);
void SetNewValue (G4UIcommand* command, G4String newValue);
private:
G4GAGTree* fpGAGTree;
G4UIcommand* fpDirectory;
G4UIcmdWithAnInteger* fpCommandVerbose;
};
#endif
source/visualization/Tree/include/G4GAGTreeSceneHandler.hh
-110
View File
@@ -1,110 +0,0 @@
//
// ********************************************************************
// * License and Disclaimer *
// * *
// * The Geant4 software is copyright of the Copyright Holders of *
// * the Geant4 Collaboration. It is provided under the terms and *
// * conditions of the Geant4 Software License, included in the file *
// * LICENSE and available at http://cern.ch/geant4/license . These *
// * include a list of copyright holders. *
// * *
// * 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. Please see the license in the file LICENSE and URL above *
// * for the full disclaimer and the limitation of liability. *
// * *
// * This code implementation is the result of the scientific and *
// * technical work of the GEANT4 collaboration. *
// * By using, copying, modifying or distributing the software (or *
// * any work based on the software) you agree to acknowledge its *
// * use in resulting scientific publications, and indicate your *
// * acceptance of all terms of the Geant4 Software license. *
// ********************************************************************
//
// Satoshi Tanaka 31th April 2001
// A scene handler to dump geometry hierarchy GAG
#ifndef G4GAGTREESCENEHANDLER_HH
#define G4GAGTREESCENEHANDLER_HH
#include "G4VTreeSceneHandler.hh"
#include <set>
class G4VPhysicalVolume;
/////////////////////////////
#include "G4GAGTreeList.hh"
class G4String ;
/////////////////////////////
///////////////////////////////////////////////////////////////////
// The algorithm of re-generating a geometry tree
// of physical volumes (PV):
//
// In each addition of the N-th PV with a given depth D, P(N;D) to
// the tree, we use the following rules:
//
// R1. We can add P(N;D) to one of the previously-generated PV nodes,
// P(N_mother <N; D_mother), if D_mother = D - 1.
//
// R2. The mother PV node P(N_mother, D_mother) of P(N,D)
// is searched in the direction to the root node
// (the world volume), starting from P(N-1;*).
//
// R3. The first PV node found in R2 is adopted as the mother.
//
// This rule can be easily implemented with a stack.
//
///////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////
// The output to G4cout becomes, for example,
//
// @@DTREEBegin
// /WORLD.0/PV1.1
// /WORLD.0/PV1.1/PV2.2
// /WORLD.0/PV1.1/PV3.3
// /WORLD.0/PV1.1/PV3.3/PV4.4
// /WORLD.0/PV5.5
// ...
// @@DTREEBegin
//
// where ".number" is the index label added by the
// G4GAGTree driver.
///////////////////////////////////////////////////////////////////
class G4GAGTreeSceneHandler: public G4VTreeSceneHandler {
public:
G4GAGTreeSceneHandler(G4VGraphicsSystem& system,
const G4String& name);
virtual ~G4GAGTreeSceneHandler();
void BeginModeling();
void EndModeling();
protected:
void RequestPrimitives(const G4VSolid&);
// Overrides G4VScenehandler::RequestPrimitives and implements dump
// of the geometry hierarchy.
std::set<G4LogicalVolume*,std::less<G4LogicalVolume*> > fLVSet;
typedef
std::set<G4LogicalVolume*,std::less<G4LogicalVolume*> >::iterator
LVSetIterator;
std::set<G4VPhysicalVolume*,std::less<G4VPhysicalVolume*> > fReplicaSet;
typedef
std::set<G4VPhysicalVolume*,std::less<G4VPhysicalVolume*> >::iterator
ReplicaSetIterator;
/////////////////////////////
void ClearPVList(void);
void InitializePVList(void);
G4GAGTreeList<G4String> fPVNameList ;
G4int fPrevDepth ;
G4String fPrevAbsPVName ;
G4int fPVCounter ;
/////////////////////////////
};
#endif
source/visualization/Tree/include/G4GAGTreeViewer.hh
-40
View File
@@ -1,40 +0,0 @@
//
// ********************************************************************
// * License and Disclaimer *
// * *
// * The Geant4 software is copyright of the Copyright Holders of *
// * the Geant4 Collaboration. It is provided under the terms and *
// * conditions of the Geant4 Software License, included in the file *
// * LICENSE and available at http://cern.ch/geant4/license . These *
// * include a list of copyright holders. *
// * *
// * 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. Please see the license in the file LICENSE and URL above *
// * for the full disclaimer and the limitation of liability. *
// * *
// * This code implementation is the result of the scientific and *
// * technical work of the GEANT4 collaboration. *
// * By using, copying, modifying or distributing the software (or *
// * any work based on the software) you agree to acknowledge its *
// * use in resulting scientific publications, and indicate your *
// * acceptance of all terms of the Geant4 Software license. *
// ********************************************************************
//
// Satoshi Tanaka 31th May 2001
// A dummy viewer for GAGTreeSceneHandler.
#ifndef G4GAGTREEVIEWER_HH
#define G4GAGTREEVIEWER_HH
#include "G4VTreeViewer.hh"
class G4GAGTreeViewer: public G4VTreeViewer {
public:
G4GAGTreeViewer(G4VSceneHandler&,const G4String& name);
virtual ~G4GAGTreeViewer();
};
#endif
source/visualization/Tree/include/G4VTree.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4VTree.hh,v 1.5 2006/06/29 21:24:45 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001
source/visualization/Tree/include/G4VTreeSceneHandler.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4VTreeSceneHandler.hh,v 1.18 2006/06/29 21:24:47 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001
source/visualization/Tree/include/G4VTreeSceneHandler.icc
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4VTreeSceneHandler.icc,v 1.8 2006/06/29 21:24:49 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 18th May 2000
source/visualization/Tree/include/G4VTreeViewer.hh
+1 -1
View File
@@ -25,7 +25,7 @@
//
//
// $Id: G4VTreeViewer.hh,v 1.5 2006/06/29 21:24:51 gunter Exp $
// GEANT4 tag $Name: geant4-08-02 $
// GEANT4 tag $Name: geant4-09-00 $
//
//
// John Allison 5th April 2001