| 1 | /* | 
|---|
| 2 | *    vmg - a versatile multigrid solver | 
|---|
| 3 | *    Copyright (C) 2012 Institute for Numerical Simulation, University of Bonn | 
|---|
| 4 | * | 
|---|
| 5 | *  vmg is free software: you can redistribute it and/or modify | 
|---|
| 6 | *  it under the terms of the GNU General Public License as published by | 
|---|
| 7 | *  the Free Software Foundation, either version 3 of the License, or | 
|---|
| 8 | *  (at your option) any later version. | 
|---|
| 9 | * | 
|---|
| 10 | *  vmg is distributed in the hope that it will be useful, | 
|---|
| 11 | *  but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|---|
| 12 | *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|---|
| 13 | *  GNU General Public License for more details. | 
|---|
| 14 | * | 
|---|
| 15 | *  You should have received a copy of the GNU General Public License | 
|---|
| 16 | *  along with this program.  If not, see <http://www.gnu.org/licenses/>. | 
|---|
| 17 | */ | 
|---|
| 18 |  | 
|---|
| 19 | /** | 
|---|
| 20 | * @file   helper.cpp | 
|---|
| 21 | * @author Julian Iseringhausen <isering@ins.uni-bonn.de> | 
|---|
| 22 | * @date   Tue Apr  5 21:03:47 2011 | 
|---|
| 23 | * | 
|---|
| 24 | * @brief  Provides various helper functions. | 
|---|
| 25 | * | 
|---|
| 26 | */ | 
|---|
| 27 |  | 
|---|
| 28 | #ifdef HAVE_CONFIG_H | 
|---|
| 29 | #include <libvmg_config.h> | 
|---|
| 30 | #endif | 
|---|
| 31 |  | 
|---|
| 32 | #include <cstring> | 
|---|
| 33 | #include <string> | 
|---|
| 34 |  | 
|---|
| 35 | #include "base/helper.hpp" | 
|---|
| 36 | #include "base/index.hpp" | 
|---|
| 37 | #include "base/vector.hpp" | 
|---|
| 38 | #include "grid/grid.hpp" | 
|---|
| 39 |  | 
|---|
| 40 | using namespace VMG; | 
|---|
| 41 |  | 
|---|
| 42 | char* Helper::GetCharArray(const std::string& str) | 
|---|
| 43 | { | 
|---|
| 44 | int size = str.size(); | 
|---|
| 45 |  | 
|---|
| 46 | char* rval = new char[size+1]; | 
|---|
| 47 |  | 
|---|
| 48 | strncpy(rval, str.c_str(), size); | 
|---|
| 49 |  | 
|---|
| 50 | rval[size] = '\0'; | 
|---|
| 51 |  | 
|---|
| 52 | return rval; | 
|---|
| 53 | } | 
|---|
| 54 |  | 
|---|
| 55 | std::string Helper::ReplaceWhitespaces(const char* buffer, const char* replace) | 
|---|
| 56 | { | 
|---|
| 57 | size_t pos; | 
|---|
| 58 |  | 
|---|
| 59 | std::string str(buffer); | 
|---|
| 60 |  | 
|---|
| 61 | while ((pos = str.find(' ')) != std::string::npos) | 
|---|
| 62 | str.replace(pos, 1, replace); | 
|---|
| 63 |  | 
|---|
| 64 | return str; | 
|---|
| 65 | } | 
|---|
| 66 |  | 
|---|
| 67 | vmg_float Helper::InterpolateTrilinear(const Vector& point, const Grid& grid) | 
|---|
| 68 | { | 
|---|
| 69 | vmg_float interpolate_vals[4], grid_vals[8]; | 
|---|
| 70 |  | 
|---|
| 71 | const Index index_global = (point - grid.Extent().Begin()) / grid.Extent().MeshWidth(); | 
|---|
| 72 | const Index index_local = index_global - grid.Global().LocalBegin() + grid.Local().Begin(); | 
|---|
| 73 | const Vector coord = (point - grid.Extent().Begin() - index_global * grid.Extent().MeshWidth()) / grid.Extent().MeshWidth(); | 
|---|
| 74 |  | 
|---|
| 75 | grid_vals[0] = grid.GetVal(index_local.X()  , index_local.Y()  , index_local.Z()  ); | 
|---|
| 76 | grid_vals[1] = grid.GetVal(index_local.X()+1, index_local.Y()  , index_local.Z()  ); | 
|---|
| 77 | grid_vals[2] = grid.GetVal(index_local.X()  , index_local.Y()+1, index_local.Z()  ); | 
|---|
| 78 | grid_vals[3] = grid.GetVal(index_local.X()+1, index_local.Y()+1, index_local.Z()  ); | 
|---|
| 79 | grid_vals[4] = grid.GetVal(index_local.X()  , index_local.Y()  , index_local.Z()+1); | 
|---|
| 80 | grid_vals[5] = grid.GetVal(index_local.X()+1, index_local.Y()  , index_local.Z()+1); | 
|---|
| 81 | grid_vals[6] = grid.GetVal(index_local.X()  , index_local.Y()+1, index_local.Z()+1); | 
|---|
| 82 | grid_vals[7] = grid.GetVal(index_local.X()+1, index_local.Y()+1, index_local.Z()+1); | 
|---|
| 83 |  | 
|---|
| 84 | for (int i=0; i<4; ++i) | 
|---|
| 85 | interpolate_vals[i] = (1.0 - coord.X()) * grid_vals[2*i] + coord.X() * grid_vals[2*i+1]; | 
|---|
| 86 |  | 
|---|
| 87 | for (int i=0; i<2; ++i) | 
|---|
| 88 | interpolate_vals[i] = (1.0 - coord.Y()) * interpolate_vals[2*i] + coord.Y() * interpolate_vals[2*i+1]; | 
|---|
| 89 |  | 
|---|
| 90 | return (1.0 - coord.Z()) * interpolate_vals[0] + coord.Z() * interpolate_vals[1]; | 
|---|
| 91 | } | 
|---|
| 92 |  | 
|---|
| 93 | bool Helper::AssertVectorsEqual(const Vector& pos_1, const Vector& pos_2, const vmg_float& tol) | 
|---|
| 94 | { | 
|---|
| 95 | // create factor with similar magnitude as pos1 but always greater equal 1 | 
|---|
| 96 | const VMG::Vector factor( abs(pos_1.X())+1, abs(pos_1.Y())+1, abs(pos_1.Z())+1); | 
|---|
| 97 | const VMG::Vector temp = (pos_1 - pos_2).Abs() / factor; | 
|---|
| 98 | bool equal = temp.IsComponentwiseLessOrEqual(tol); | 
|---|
| 99 | assert(equal); | 
|---|
| 100 | return equal; | 
|---|
| 101 | } | 
|---|