LCOV - code coverage report
Current view: top level - ugbase/lib_algebra/algebra_common - vector_util.h (source / functions) Coverage Total Hit
Test: coverage.info Lines: 0.0 % 4 0
Test Date: 2025-09-21 23:31:46 Functions: - 0 0

            Line data    Source code
       1              : /*
       2              :  * Copyright (c) 2013-2015:  G-CSC, Goethe University Frankfurt
       3              :  * Author: Martin Rupp
       4              :  * 
       5              :  * This file is part of UG4.
       6              :  * 
       7              :  * UG4 is free software: you can redistribute it and/or modify it under the
       8              :  * terms of the GNU Lesser General Public License version 3 (as published by the
       9              :  * Free Software Foundation) with the following additional attribution
      10              :  * requirements (according to LGPL/GPL v3 §7):
      11              :  * 
      12              :  * (1) The following notice must be displayed in the Appropriate Legal Notices
      13              :  * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
      14              :  * 
      15              :  * (2) The following notice must be displayed at a prominent place in the
      16              :  * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
      17              :  * 
      18              :  * (3) The following bibliography is recommended for citation and must be
      19              :  * preserved in all covered files:
      20              :  * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
      21              :  *   parallel geometric multigrid solver on hierarchically distributed grids.
      22              :  *   Computing and visualization in science 16, 4 (2013), 151-164"
      23              :  * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
      24              :  *   flexible software system for simulating pde based models on high performance
      25              :  *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
      26              :  * 
      27              :  * This program is distributed in the hope that it will be useful,
      28              :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      29              :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
      30              :  * GNU Lesser General Public License for more details.
      31              :  */
      32              : 
      33              : #ifndef VECTOR_UTIL_H_
      34              : #define VECTOR_UTIL_H_
      35              : 
      36              : #include "lib_algebra/small_algebra/blocks.h"
      37              : #ifdef UG_PARALLEL
      38              : #include "pcl/pcl.h"
      39              : #endif
      40              : 
      41              : namespace ug{
      42              : 
      43              : template<typename TBlock>
      44              : bool BlockVectorFiniteAndNotTooBig(TBlock &v, double tooBigValue=1e24)
      45              : {
      46              :         for(size_t j=0; j< GetSize(v); j++)
      47              :         {
      48              :                 double d = BlockRef(v, j);
      49              :                 if(d > tooBigValue || d < -tooBigValue || std::isfinite(d) == false)
      50              :                                 return false;
      51              :         }
      52              :         return true;
      53              : }
      54              : 
      55              : template<typename TBlock>
      56              : bool BlockMatrixFiniteAndNotTooBig(TBlock &m, double tooBigValue=1e24)
      57              : {
      58            0 :         for(size_t r=0; r<GetRows(m); r++)
      59            0 :                 for(size_t c=0; c< GetCols(m); c++)
      60              :                 {
      61            0 :                         double d = BlockRef(m, r, c);
      62            0 :                         if(d > tooBigValue || d < -tooBigValue || std::isfinite(d) == false)
      63              :                                         return false;
      64              :                 }
      65              : 
      66              :         return true;
      67              : }
      68              : 
      69              : 
      70              : template<typename TVector>
      71              : bool IsFiniteAndNotTooBig(const TVector &v, double tooBigValue=1e24)
      72              : {
      73              :         for(size_t i=0; i<v.size(); i++)
      74              :                 if(BlockVectorFiniteAndNotTooBig(v[i], tooBigValue) == false)
      75              :                         return false;
      76              :         return true;
      77              : }
      78              : 
      79              : /*template<typename TVector>
      80              : bool IsFinite(const TVector &v)
      81              : {
      82              :         for(size_t i=0; i<v.size(); i++)
      83              :         {
      84              :                 for(size_t j=0; j< GetSize(v[i]); j++)
      85              :                 {
      86              :                         double d = BlockRef(v[i], j);
      87              :                         if(isfinite(d) == false)
      88              :                                 return false;
      89              :                 }
      90              :         }
      91              :         return true;
      92              : }*/
      93              : 
      94              : #ifdef UG_PARALLEL
      95              : template<typename TVector>
      96              : bool IsFiniteAndNotTooBig(const ParallelVector<TVector> &v)
      97              : {
      98              :         return AllProcsTrue(IsFiniteAndNotTooBig((TVector&)v), v.layouts()->proc_comm());
      99              : }
     100              : template<typename TVector>
     101              : bool IsFinite(const ParallelVector<TVector> &v)
     102              : {
     103              :         return AllProcsTrue(IsFiniteAndNotTooBig((TVector&)v), v.layouts()->proc_comm());
     104              : }
     105              : #endif
     106              : 
     107              : }
     108              : #endif /* VECTOR_UTIL_H_ */
        

Generated by: LCOV version 2.0-1