Geant4 Cross Reference |
1 // 1 // 2 // ******************************************* 2 // ******************************************************************** 3 // * License and Disclaimer 3 // * License and Disclaimer * 4 // * 4 // * * 5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of * 6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and * 7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file * 8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These * 9 // * include a list of copyright holders. 9 // * include a list of copyright holders. * 10 // * 10 // * * 11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing * 12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this * 13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, * 14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its * 15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above * 16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. * 17 // * 17 // * * 18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and * 19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. * 20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or * 21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its * 22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your * 23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. * 24 // ******************************************* 24 // ******************************************************************** 25 // 25 // 26 // 26 // 27 // 27 // 28 // by I.Hrivnacova, 27 Sep 99 28 // by I.Hrivnacova, 27 Sep 99 29 29 30 #include "G3MatTableEntry.hh" 30 #include "G3MatTableEntry.hh" 31 31 32 #include "G4Material.hh" 32 #include "G4Material.hh" 33 33 34 G3MatTableEntry::G3MatTableEntry(G4int id, G4M 34 G3MatTableEntry::G3MatTableEntry(G4int id, G4Material* material) 35 : fID(id), 35 : fID(id), 36 fMaterial(material) 36 fMaterial(material) 37 {} 37 {} 38 38 39 G3MatTableEntry::G3MatTableEntry(const G3MatTa 39 G3MatTableEntry::G3MatTableEntry(const G3MatTableEntry& right) 40 : fID(right.GetID()), 40 : fID(right.GetID()), 41 fMaterial(right.GetMaterial()) 41 fMaterial(right.GetMaterial()) 42 {} 42 {} 43 43 44 G3MatTableEntry::~G3MatTableEntry() 44 G3MatTableEntry::~G3MatTableEntry() 45 {} 45 {} 46 46 47 G3MatTableEntry& G3MatTableEntry::operator=(co 47 G3MatTableEntry& G3MatTableEntry::operator=(const G3MatTableEntry& right) 48 { 48 { 49 if (&right == this) { return *this; } 49 if (&right == this) { return *this; } 50 fID = right.GetID(); 50 fID = right.GetID(); 51 fMaterial = right.GetMaterial(); 51 fMaterial = right.GetMaterial(); 52 return *this; 52 return *this; 53 } 53 } 54 54 55 G4bool G3MatTableEntry::operator==(const G3Mat 55 G4bool G3MatTableEntry::operator==(const G3MatTableEntry& right) const 56 { 56 { 57 if (fID == right.GetID()) 57 if (fID == right.GetID()) 58 return true; 58 return true; 59 else 59 else 60 return false; 60 return false; 61 } 61 } 62 62 63 G4bool G3MatTableEntry::operator!=(const G3Mat 63 G4bool G3MatTableEntry::operator!=(const G3MatTableEntry& right) const 64 { 64 { 65 if (*this == right) 65 if (*this == right) 66 return false; 66 return false; 67 else 67 else 68 return true; 68 return true; 69 } 69 } 70 70 71 71