Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/global/management/include/G4OrderedTable.hh

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ]

Diff markup

Differences between /global/management/include/G4OrderedTable.hh (Version 11.3.0) and /global/management/include/G4OrderedTable.hh (Version 8.2.p1)


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