source: trunk/source/global/management/include/G4OrderedTable.hh @ 1347

Last change on this file since 1347 was 1337, checked in by garnier, 14 years ago

tag geant4.9.4 beta 1 + modifs locales

File size: 3.7 KB
Line 
1//
2// ********************************************************************
3// * License and Disclaimer                                           *
4// *                                                                  *
5// * The  Geant4 software  is  copyright of the Copyright Holders  of *
6// * the Geant4 Collaboration.  It is provided  under  the terms  and *
7// * conditions of the Geant4 Software License,  included in the file *
8// * LICENSE and available at  http://cern.ch/geant4/license .  These *
9// * include a list of copyright holders.                             *
10// *                                                                  *
11// * Neither the authors of this software system, nor their employing *
12// * institutes,nor the agencies providing financial support for this *
13// * work  make  any representation or  warranty, express or implied, *
14// * regarding  this  software system or assume any liability for its *
15// * use.  Please see the license in the file  LICENSE  and URL above *
16// * for the full disclaimer and the limitation of liability.         *
17// *                                                                  *
18// * This  code  implementation is the result of  the  scientific and *
19// * technical work of the GEANT4 collaboration.                      *
20// * By using,  copying,  modifying or  distributing the software (or *
21// * any work based  on the software)  you  agree  to acknowledge its *
22// * use  in  resulting  scientific  publications,  and indicate your *
23// * acceptance of all terms of the Geant4 Software license.          *
24// ********************************************************************
25//
26//
27// $Id: G4OrderedTable.hh,v 1.14 2007/11/13 17:35:06 gcosmo Exp $
28// GEANT4 tag $Name: geant4-09-04-beta-01 $
29//
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>.
48
49// ------------------------------------------------------------
50
51#ifndef G4OrderedTable_h
52#define G4OrderedTable_h 1
53
54#include "globals.hh"
55#include <vector>
56class G4DataVector;
57
58class G4OrderedTable : public std::vector<G4DataVector*> 
59{
60
61 public: // with description
62
63  G4OrderedTable();
64    // Deafult constructor.
65
66  explicit G4OrderedTable(size_t cap);
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).
81
82  friend std::ostream& operator<<(std::ostream& out, G4OrderedTable& table);
83
84};
85
86typedef G4OrderedTable::iterator G4OrderedTableIterator;
87
88#include "G4DataVector.hh"
89
90inline 
91void 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}
109
110#endif
Note: See TracBrowser for help on using the repository browser.