| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 // G4OrderedTable <<
27 // 23 //
28 // Class description: << 24 // $Id: G4OrderedTable.hh,v 1.10 2002/04/19 07:10:32 gcosmo Exp $
>> 25 // GEANT4 tag $Name: geant4-04-01 $
29 // 26 //
30 // Utility class, defining an ordered collecti << 27 //
>> 28 // ------------------------------------------------------------
>> 29 // GEANT 4 class header file
>> 30 // ------------------------------------------------------------
>> 31 // Sep. 1996 : M.Maire
>> 32 // Jan. 2001 : H.Kurashige
>> 33 // - G4ValVector is replaced with G4DataVector
>> 34 // - Migrated to G4std::vector<G4DataVector*>.
>> 35 // Sep. 2001 : H.Kurashige
>> 36 // - Add
>> 37 // G4bool Store(const G4String&, G4bool)
>> 38 // G4bool Retrieve(const G4String&, G4bool);
>> 39 // ostream& operator<<(ostream&, G4OrderedTable&)
>> 40 //
>> 41 // Class Description:
>> 42 //
>> 43 // Utility class, defining an ordered collection of vectors
>> 44 // of <G4double>.
31 45
32 // Author: M.Maire (LAPP), September 1996 << 46 // ------------------------------------------------------------
33 // Revisions: H.Kurashige (Kobe Univ.), Januar <<
34 // ------------------------------------------- <<
35 #ifndef G4OrderedTable_hh <<
36 #define G4OrderedTable_hh 1 <<
37 47
38 #include <vector> << 48 #ifndef G4OrderedTable_h
>> 49 #define G4OrderedTable_h 1
39 50
40 #include "G4DataVector.hh" <<
41 #include "globals.hh" 51 #include "globals.hh"
>> 52 #include "g4std/vector"
>> 53 class G4DataVector;
42 54
43 class G4OrderedTable : public std::vector<G4Da << 55 class G4OrderedTable : public G4std::vector<G4DataVector*>
44 { 56 {
45 public: <<
46 G4OrderedTable() = default; <<
47 // Default constructor <<
48 57
49 explicit G4OrderedTable(std::size_t cap); << 58 public: // with description
50 // Constructor given a 'capacity' defining t << 59
51 // number of elements (NULL pointers are fil << 60 G4OrderedTable();
>> 61 // Deafult constructor.
52 62
53 virtual ~G4OrderedTable() = default; << 63 G4OrderedTable(size_t capacity);
54 // Empty Destructor << 64 // Constructor given a 'capacity' defining the initial
>> 65 // number of elements (NULL pointers are filled up)
55 66
56 void clearAndDestroy(); << 67 virtual ~G4OrderedTable();
57 // Removes all elements and deletes all non- << 68 // Empty Destructor
58 69
59 G4bool Store(const G4String& filename, G4boo << 70 inline void clearAndDestroy();
60 // Stores OrderedTable in a file (returns fa << 71 // Removes all elements and deletes all non-NULL pointers
61 72
62 G4bool Retrieve(const G4String& filename, G4 << 73 G4bool Store(const G4String& filename, G4bool ascii=false);
63 // Retrieves OrderedTable from a file (retur << 74 // Stores OrderedTable in a file (returns false in case of failure).
>> 75
>> 76 G4bool Retrieve(const G4String& filename, G4bool ascii=false);
>> 77 // Retrieves OrderedTable from a file (returns false in case of failure).
>> 78
>> 79 friend G4std::ostream& operator<<(G4std::ostream& out, G4OrderedTable& table);
64 80
65 friend std::ostream& operator<<(std::ostream <<
66 }; 81 };
67 82
>> 83 typedef G4OrderedTable::iterator G4OrderedTableIterator;
>> 84
>> 85 #include "G4DataVector.hh"
>> 86
>> 87 inline
>> 88 void G4OrderedTable::clearAndDestroy()
>> 89 {
>> 90 G4DataVector* a;
>> 91 while (size()>0) {
>> 92 a = back();
>> 93 pop_back();
>> 94 for (iterator i=begin(); i!=end(); i++){
>> 95 if (*i==a) {
>> 96 erase(i);
>> 97 i--;
>> 98 }
>> 99 }
>> 100 if ( a ) delete a;
>> 101 }
>> 102 }
>> 103
>> 104
68 #endif 105 #endif
>> 106
>> 107
69 108