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