/*! \file scalar_algorithm_reduce_domain.cpp \author Ha NGUYEN \since 23 June 2016 \date 23 June 2016 \brief Algorithm for reduce a domain to a scalar */ #include "scalar_algorithm_reduce_domain.hpp" #include "domain.hpp" #include "scalar.hpp" #include "reduce_domain_to_scalar.hpp" #include "grid.hpp" #include "grid_transformation_factory_impl.hpp" namespace xios { shared_ptr CScalarAlgorithmReduceDomain::create(bool isSource, CGrid* gridDst, CGrid* gridSrc, CTransformation* transformation, int elementPositionInGrid, std::map& elementPositionInGridSrc2ScalarPosition, std::map& elementPositionInGridSrc2AxisPosition, std::map& elementPositionInGridSrc2DomainPosition, std::map& elementPositionInGridDst2ScalarPosition, std::map& elementPositionInGridDst2AxisPosition, std::map& elementPositionInGridDst2DomainPosition) TRY { std::vector scalarListDestP = gridDst->getScalars(); std::vector domainListSrcP = gridSrc->getDomains(); CReduceDomainToScalar* reduceDomain = dynamic_cast (transformation); int scalarDstIndex = elementPositionInGridDst2ScalarPosition[elementPositionInGrid]; int domainSrcIndex = elementPositionInGridSrc2DomainPosition[elementPositionInGrid]; return make_shared(isSource, scalarListDestP[scalarDstIndex], domainListSrcP[domainSrcIndex], reduceDomain); } CATCH bool CScalarAlgorithmReduceDomain::dummyRegistered_ = CScalarAlgorithmReduceDomain::registerTrans(); bool CScalarAlgorithmReduceDomain::registerTrans() TRY { return CGridTransformationFactory::registerTransformation(TRANS_REDUCE_DOMAIN_TO_SCALAR, create); } CATCH CScalarAlgorithmReduceDomain::CScalarAlgorithmReduceDomain(bool isSource, CScalar* scalarDestination, CDomain* domainSource, CReduceDomainToScalar* algo) : CAlgorithmTransformationReduce(isSource), domainSrc_(domainSource) TRY { algo->checkValid(scalarDestination, domainSource); StdString op; switch (algo->operation) { case CReduceDomainToScalar::operation_attr::sum: operator_ = EReduction::sum; break; case CReduceDomainToScalar::operation_attr::min: operator_ = EReduction::min; break; case CReduceDomainToScalar::operation_attr::max: operator_ = EReduction::max; break; case CReduceDomainToScalar::operation_attr::average: operator_ = EReduction::average; break; default: ERROR("CScalarAlgorithmReduceDomain::CScalarAlgorithmReduceDomain(CDomain* domainDestination, CDomain* domainSource, CReduceDomainToScalar* algo)", << "Operation must be defined." << "Domain source " <getId() << std::endl << "Scalar destination " << scalarDestination->getId()); } bool local=false ; if (!algo->local.isEmpty()) local=algo->local ; auto& transMap = this->transformationMapping_; if (local) { scalarDestination->n=1 ; // no mask scalarDestination->mask.reset() ; CArray srcGlobalIndex ; domainSource->getLocalView(CElementView::WORKFLOW)->getGlobalIndexView(srcGlobalIndex) ; size_t nbIdx = srcGlobalIndex.numElements(); if (nbIdx==0) scalarDestination->n=0 ; scalarDestination->checkAttributes() ; for (size_t idx = 0; idx < nbIdx; ++idx) { size_t globalIdx = srcGlobalIndex(idx); transformationMapping_[0].push_back(globalIdx); } } else { scalarDestination->checkAttributes() ; int globalIndexSize = domainSource->getLocalView(CElementView::WORKFLOW)->getGlobalSize(); CArray dstGlobalIndex ; scalarDestination->getLocalView(CElementView::WORKFLOW)->getGlobalIndexView(dstGlobalIndex) ; if (dstGlobalIndex.numElements()!=0) for (int idx = 0; idx < globalIndexSize; ++idx) transformationMapping_[0].push_back(idx); } this->computeAlgorithm(domainSource->getLocalView(CElementView::WORKFLOW), scalarDestination->getLocalView(CElementView::WORKFLOW)) ; } CATCH CScalarAlgorithmReduceDomain::~CScalarAlgorithmReduceDomain() TRY { } CATCH }