Line data    Source code

       1             : ///////////////////////////////////////////////////////////////////////////////
       2             : // Copyright 2019 Lakshman Anumolu, Raunak Bardia.
       3             : //
       4             : // Redistribution and use in source and binary forms, with or without
       5             : // modification, are permitted provided that the following conditions are
       6             : // met:
       7             : //
       8             : // 1. Redistributions of source code must retain the above copyright notice,
       9             : // this list of conditions and the following disclaimer.
      10             : //
      11             : // 2. Redistributions in binary form must reproduce the above copyright notice,
      12             : // this list of conditions and the following disclaimer in the documentation
      13             : // and/or other materials provided with the distribution.
      14             : //
      15             : // 3. Neither the name of the copyright holder nor the names of its contributors
      16             : // may be used to endorse or promote products derived from this software without
      17             : // specific prior written permission.
      18             : //
      19             : // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
      20             : // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
      21             : // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
      22             : // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
      23             : // HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
      24             : // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
      25             : // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
      26             : // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
      27             : // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
      28             : // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
      29             : // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
      30             : ///////////////////////////////////////////////////////////////////////////////
      31             : 
      32             : #include "gals/analytical-fields/levelset.h"
      33             : #include "gals/utilities/utilities.h"
      34             : 
      35             : template <typename T_GRID, typename T>
      36           1 : GALS::ANALYTICAL_FIELDS::Levelset<T_GRID, T>::Levelset(const T_GRID& grid, const GALS::INPUT_FIELDS::Levelset& inputs)
      37           1 :     : m_grid(grid), m_inputs(inputs)
      38             : {
      39           1 : }
      40             : 
      41             : template <typename T_GRID, typename T>
      42           1 : GALS::ANALYTICAL_FIELDS::Levelset<T_GRID, T>::~Levelset()
      43             : {
      44           1 : }
      45             : 
      46             : template <typename T_GRID, typename T>
      47           1 : void GALS::ANALYTICAL_FIELDS::Levelset<T_GRID, T>::compute(
      48             :     const GALS::CPU::Array<T_GRID, GALS::CPU::Vec3<T>>& positions, GALS::CPU::Levelset<T_GRID, T>& levelset)
      49             : {
      50           2 :   const GALS::CPU::Vec3<int> num_cells = positions.numCells();
      51           1 :   const auto& levelset_name = m_inputs.name;
      52             : 
      53           1 :   switch (levelset_name_map[levelset_name]) {
      54             :     case LevelsetFieldNames::CIRCLE: {
      55             :       auto& phi = levelset.phi();
      56             : 
      57           2 :       GALS::CPU::Vec3<T> distance_vec;
      58             : 
      59          21 :       for (int i = 0; i < num_cells[0]; ++i)
      60         210 :         for (int j = 0; j < num_cells[1]; ++j)
      61         300 :           for (int k = 0; k < num_cells[2]; ++k) {
      62         100 :             distance_vec = positions(i, j, k) - m_inputs.center;
      63         100 :             phi(i, j, k) = distance_vec.mag() - m_inputs.radius;
      64             :           }
      65             : 
      66             :       break;
      67             :     }
      68             : 
      69             :     default:
      70             :       break;
      71             :   }
      72           1 : }
      73             : 
      74             : template class GALS::ANALYTICAL_FIELDS::Levelset<GALS::CPU::Grid<double, 1>, double>;
      75             : template class GALS::ANALYTICAL_FIELDS::Levelset<GALS::CPU::Grid<double, 2>, double>;
      76           3 : template class GALS::ANALYTICAL_FIELDS::Levelset<GALS::CPU::Grid<double, 3>, double>;