| 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 // G4OrderedTable <<
27 // 26 //
28 // Class description: << 27 // $Id: G4OrderedTable.hh 67970 2013-03-13 10:10:06Z gcosmo $
29 // 28 //
30 // Utility class, defining an ordered collecti << 29 //
>> 30 // ------------------------------------------------------------
>> 31 // GEANT 4 class header file
>> 32 // ------------------------------------------------------------
>> 33 // Sep. 1996 : M.Maire
>> 34 // Jan. 2001 : H.Kurashige
>> 35 // - G4ValVector is replaced with G4DataVector
>> 36 // - Migrated to std::vector<G4DataVector*>.
>> 37 // Sep. 2001 : H.Kurashige
>> 38 // - Add
>> 39 // G4bool Store(const G4String&, G4bool)
>> 40 // G4bool Retrieve(const G4String&, G4bool);
>> 41 // ostream& operator<<(ostream&, G4OrderedTable&)
>> 42 //
>> 43 // Class Description:
>> 44 //
>> 45 // Utility class, defining an ordered collection of vectors
>> 46 // of <G4double>.
31 47
32 // Author: M.Maire (LAPP), September 1996 << 48 // ------------------------------------------------------------
33 // Revisions: H.Kurashige (Kobe Univ.), Januar <<
34 // ------------------------------------------- <<
35 #ifndef G4OrderedTable_hh <<
36 #define G4OrderedTable_hh 1 <<
37 49
38 #include <vector> << 50 #ifndef G4OrderedTable_h
>> 51 #define G4OrderedTable_h 1
39 52
40 #include "G4DataVector.hh" <<
41 #include "globals.hh" 53 #include "globals.hh"
>> 54 #include <vector>
>> 55 class G4DataVector;
42 56
43 class G4OrderedTable : public std::vector<G4Da << 57 class G4OrderedTable : public std::vector<G4DataVector*>
44 { 58 {
45 public: <<
46 G4OrderedTable() = default; <<
47 // Default constructor <<
48 <<
49 explicit G4OrderedTable(std::size_t cap); <<
50 // Constructor given a 'capacity' defining t <<
51 // number of elements (NULL pointers are fil <<
52 <<
53 virtual ~G4OrderedTable() = default; <<
54 // Empty Destructor <<
55 59
56 void clearAndDestroy(); << 60 public: // with description
57 // Removes all elements and deletes all non- <<
58 61
59 G4bool Store(const G4String& filename, G4boo << 62 G4OrderedTable();
60 // Stores OrderedTable in a file (returns fa << 63 // Deafult constructor.
61 64
62 G4bool Retrieve(const G4String& filename, G4 << 65 explicit G4OrderedTable(size_t cap);
63 // Retrieves OrderedTable from a file (retur << 66 // Constructor given a 'capacity' defining the initial
>> 67 // number of elements (NULL pointers are filled up)
>> 68
>> 69 virtual ~G4OrderedTable();
>> 70 // Empty Destructor
>> 71
>> 72 inline void clearAndDestroy();
>> 73 // Removes all elements and deletes all non-NULL pointers
>> 74
>> 75 G4bool Store(const G4String& filename, G4bool ascii=false);
>> 76 // Stores OrderedTable in a file (returns false in case of failure).
>> 77
>> 78 G4bool Retrieve(const G4String& filename, G4bool ascii=false);
>> 79 // Retrieves OrderedTable from a file (returns false in case of failure).
64 80
65 friend std::ostream& operator<<(std::ostream 81 friend std::ostream& operator<<(std::ostream& out, G4OrderedTable& table);
>> 82
66 }; 83 };
>> 84
>> 85 typedef G4OrderedTable::iterator G4OrderedTableIterator;
>> 86
>> 87 #include "G4DataVector.hh"
>> 88
>> 89 inline
>> 90 void G4OrderedTable::clearAndDestroy()
>> 91 {
>> 92 G4DataVector* a = 0;
>> 93 while (size()>0)
>> 94 {
>> 95 a = back();
>> 96 pop_back();
>> 97 for (iterator i=begin(); i!=end(); i++)
>> 98 {
>> 99 if (*i==a)
>> 100 {
>> 101 erase(i);
>> 102 i--;
>> 103 }
>> 104 }
>> 105 if ( a ) { delete a; }
>> 106 }
>> 107 }
67 108
68 #endif 109 #endif
69 110