Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Class Members | File Members

LayoutDataI.H

Go to the documentation of this file.
00001 /*   _______              __
00002     / ___/ /  ___  __ _  / /  ___
00003    / /__/ _ \/ _ \/  V \/ _ \/ _ \
00004    \___/_//_/\___/_/_/_/_.__/\___/
00005 */
00006 // CHOMBO Copyright (c) 2000-2004, The Regents of the University of
00007 // California, through Lawrence Berkeley National Laboratory (subject to
00008 // receipt of any required approvals from U.S. Dept. of Energy).  All
00009 // rights reserved.
00010 //
00011 // Redistribution and use in source and binary forms, with or without
00012 // modification, are permitted provided that the following conditions are met:
00013 //
00014 // (1) Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 // (2) Redistributions in binary form must reproduce the above copyright
00017 // notice, this list of conditions and the following disclaimer in the
00018 // documentation and/or other materials provided with the distribution.
00019 // (3) Neither the name of Lawrence Berkeley National Laboratory, U.S.
00020 // Dept. of Energy nor the names of its contributors may be used to endorse
00021 // or promote products derived from this software without specific prior
00022 // written permission.
00023 //
00024 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
00025 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
00026 // TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
00027 // PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
00028 // OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00029 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00030 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00031 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00032 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00033 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00034 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00035 //
00036 // You are under no obligation whatsoever to provide any bug fixes,
00037 // patches, or upgrades to the features, functionality or performance of
00038 // the source code ("Enhancements") to anyone; however, if you choose to
00039 // make your Enhancements available either publicly, or directly to
00040 // Lawrence Berkeley National Laboratory, without imposing a separate
00041 // written license agreement for such Enhancements, then you hereby grant
00042 // the following license: a non-exclusive, royalty-free perpetual license
00043 // to install, use, modify, prepare derivative works, incorporate into
00044 // other computer software, distribute, and sublicense such Enhancements or
00045 // derivative works thereof, in binary and source code form.
00046 //
00047 // TRADEMARKS. Product and company names mentioned herein may be the
00048 // trademarks of their respective owners.  Any rights not expressly granted
00049 // herein are reserved.
00050 //
00051 
00052 #ifndef _LAYOUTDATAI_H_
00053 #define _LAYOUTDATAI_H_
00054 
00055 #include "MayDay.H"
00056 #include "DataIterator.H"
00057 #include "SPMD.H"
00058 
00059 template<class T>
00060 inline const T& LayoutData<T>::operator [] (const DataIndex& a_index) const
00061 {
00062  CH_assert(m_boxLayout.check(a_index));
00063 
00064   // using a DataIndex for data on another processor -
00065   // if you are reading this error in a debugger, then you haven't used
00066   // addBox(Box, int) correctly, or you are using a LayoutIterator to
00067   // access a data holder.
00068  CH_assert(m_boxLayout.procID(a_index) == procID());
00069 
00070   return *(m_vector[m_boxLayout.index(a_index)]);
00071 }
00072 
00073 template<class T>
00074 inline const T& LayoutData<T>::operator [] (const DataIterator& a_index) const
00075 {
00076   return (*this)[a_index()];
00077 }
00078 
00079 template<class T>
00080 inline T& LayoutData<T>::operator [] (const DataIndex& a_index)
00081 {
00082  CH_assert(m_boxLayout.check(a_index));
00083 
00084   // using a DataIndex for data on another processor -
00085   // if you are reading this error in a debugger, then you haven't used
00086   // addBox(Box, int) correctly, or you are using a LayoutIterator to
00087   // access a data holder.
00088  CH_assert(m_boxLayout.procID(a_index) == procID());
00089 
00090   return *(m_vector[m_boxLayout.index(a_index)]);
00091 }
00092 
00093 template<class T>
00094 inline T& LayoutData<T>::operator [] (const DataIterator& a_index)
00095 {
00096 
00097   return (*this)[a_index()];
00098 }
00099 
00100 template<class T>
00101 inline Box LayoutData<T>::box(const DataIndex& a_index) const
00102 {
00103   return m_boxLayout.get(a_index);
00104 }
00105 
00106 template<class T>
00107 inline Box LayoutData<T>::box(const DataIterator& a_index) const
00108 {
00109   return m_boxLayout.get(a_index());
00110 }
00111 
00112 template<class T>
00113 inline DataIterator LayoutData<T>::dataIterator() const
00114 {
00115   return m_boxLayout.dataIterator();
00116 }
00117 
00118 template<class T>
00119 inline LayoutData<T>::LayoutData()
00120 {
00121   m_boxLayout.close();
00122   m_callDelete = true;
00123 }
00124 
00125 template<class T>
00126 inline LayoutData<T>::LayoutData(const BoxLayout& a_dp)
00127   :
00128   m_boxLayout(a_dp)
00129 {
00130  CH_assert(a_dp.isClosed());
00131   m_callDelete = true;
00132   allocate();
00133 }
00134 
00135 template<class T>
00136 inline void LayoutData<T>::define(const BoxLayout& a_dp)
00137 {
00138  CH_assert(a_dp.isClosed());
00139   m_boxLayout = a_dp;
00140   allocate();
00141 }
00142 
00143 template<class T>
00144 inline LayoutData<T>::~LayoutData()
00145 {
00146   if (m_callDelete == true)
00147   {
00148     for (DataIterator it(dataIterator()); it.ok(); ++it)
00149     {
00150       delete m_vector[m_boxLayout.index(it())];
00151     }
00152   }
00153 }
00154 
00155 template<class T>
00156 inline void LayoutData<T>::allocate()
00157 {
00158   m_callDelete = true;
00159 
00160   for (unsigned int i = 0; i < m_vector.size(); ++i)
00161   {
00162     delete m_vector[i];
00163     m_vector[i] = NULL;
00164   }
00165 
00166   m_vector.resize(m_boxLayout.size(), NULL);
00167 
00168   for (DataIterator it(dataIterator()); it.ok(); ++it)
00169   {
00170     unsigned int index = m_boxLayout.index(it());
00171     if (m_vector[index] == NULL)
00172     {
00173       m_vector[index] = new T();
00174       if (m_vector[index] == NULL)
00175       {
00176         MayDay::Error("OutOfMemory in boxlayoutdata::setVector");
00177       }
00178     }
00179   }
00180 }
00181 
00182 #endif

Generated on Wed Oct 5 13:52:08 2005 for Chombo&AMRSelfGravity by  doxygen 1.4.1