00001 // 00002 // ******************************************************************** 00003 // * License and Disclaimer * 00004 // * * 00005 // * The Geant4 software is copyright of the Copyright Holders of * 00006 // * the Geant4 Collaboration. It is provided under the terms and * 00007 // * conditions of the Geant4 Software License, included in the file * 00008 // * LICENSE and available at http://cern.ch/geant4/license . These * 00009 // * include a list of copyright holders. * 00010 // * * 00011 // * Neither the authors of this software system, nor their employing * 00012 // * institutes,nor the agencies providing financial support for this * 00013 // * work make any representation or warranty, express or implied, * 00014 // * regarding this software system or assume any liability for its * 00015 // * use. Please see the license in the file LICENSE and URL above * 00016 // * for the full disclaimer and the limitation of liability. * 00017 // * * 00018 // * This code implementation is the result of the scientific and * 00019 // * technical work of the GEANT4 collaboration. * 00020 // * By using, copying, modifying or distributing the software (or * 00021 // * any work based on the software) you agree to acknowledge its * 00022 // * use in resulting scientific publications, and indicate your * 00023 // * acceptance of all terms of the Geant4 Software license. * 00024 // ******************************************************************** 00025 // 00026 // 00027 // $Id$ 00028 // 00029 // 00030 // ------------------------------------------------------------ 00031 // GEANT 4 class header file 00032 // 00033 // History: first implementation, based on object model of 00034 // 2nd December 1995, G.Cosmo 00035 // ------------------------------------------------------------ 00036 00037 #ifndef G4FastVector_h 00038 #define G4FastVector_h 1 00039 00040 #include "globals.hh" 00041 00042 template <class Type, G4int N> 00043 class G4FastVector 00044 { 00045 // Template class defining a vector of pointers, 00046 // not performing boundary checking. 00047 00048 public: 00049 00050 G4FastVector() { ptr = &theArray[0]; } 00051 00052 ~G4FastVector() 00053 { 00054 if (ptr != &theArray[0]) delete [] ptr; 00055 } 00056 00057 inline Type* operator[](G4int anIndex) const 00058 // Access operator to the array. 00059 { 00060 return ptr[anIndex]; 00061 } 00062 00063 void Initialize(G4int items) 00064 // Normally the pointer ptr points to the stack-array 00065 // theArray; only when the number of items is greater 00066 // than N, memory is allocated dynamically. 00067 { 00068 if (ptr != &theArray[0]) 00069 delete [] ptr; 00070 if (items > N) 00071 ptr = new Type*[items]; 00072 else 00073 ptr = &theArray[0]; 00074 } 00075 00076 inline void SetElement(G4int anIndex, Type *anElement) 00077 // To insert an element at the given position inside 00078 // the vector. 00079 { 00080 ptr[anIndex] = anElement; 00081 } 00082 00083 private: 00084 00085 Type *theArray[N]; 00086 Type **ptr; 00087 }; 00088 00089 #endif 00090