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 _MGINTERP_H_ 00053 #define _MGINTERP_H_ 00054 00055 #include "REAL.H" 00056 #include "LevelData.H" 00057 #include "BaseFab.H" 00058 #include "FArrayBox.H" 00059 #include "ProblemDomain.H" 00060 00061 class DisjointBoxLayout; 00062 00064 00069 class MGInterp 00070 { 00071 public: 00073 MGInterp(); 00074 00076 ~MGInterp(); 00077 00079 MGInterp(const DisjointBoxLayout& a_fineDomain, 00080 int a_numcomps, 00081 int a_refRatio, 00082 const Box& a_problemDomain); 00083 00085 MGInterp(const DisjointBoxLayout& a_fineDomain, 00086 int a_numcomps, 00087 int a_refRatio, 00088 const ProblemDomain& a_problemDomain); 00089 00091 00094 void define(const DisjointBoxLayout& a_fineDomain, // the fine level domain 00095 int a_numcomps, // the number of components 00096 int a_refRatio, // the refinement ratio 00097 const Box& a_problemDomain); // problem domain 00098 00100 00103 void define(const DisjointBoxLayout& a_fineDomain, // the fine level domain 00104 int a_numcomps, // the number of components 00105 int a_refRatio, // the refinement ratio 00106 const ProblemDomain& a_problemDomain); // problem domain 00107 00109 00112 void interpToFine(LevelData<FArrayBox>& a_fineData, 00113 const LevelData<FArrayBox>& a_coarseData); 00114 00116 bool isDefined() const; 00117 00118 protected: 00119 bool m_isDefined; 00120 00121 // the refinement ratio 00122 int m_refRatio; 00123 00124 // work array for the coarse level data in a domain that is the 00125 // outline of the fine level domain on the coarse level 00126 // 00127 LevelData<FArrayBox> m_coarsenedFineData; 00128 DisjointBoxLayout m_grids; 00129 00130 // problem domain 00131 ProblemDomain m_problemDomain; 00132 }; 00133 00134 #endif