IntegrationList.h

Go to the documentation of this file.

/* This file is part of MoDELib, the Mechanics Of Defects Evolution Library.
 *
 *
 * MoDELib is distributed without any warranty under the
 * GNU General Public License (GPL) v2 <http://www.gnu.org/licenses/>.
 */
 
#ifndef model_IntegrationList_H_
#define model_IntegrationList_H_
 
#include <deque>
#include <utility>      // std::pair, std::make_pair
#include <chrono>
#include <Quadrature.h>
 
#include <BarycentricTraits.h>
//#include <TestExpression.h>
//#include <LinearWeakList.h>
 
namespace model
{
    
    /**************************************************************************/
    /**************************************************************************/
    template <int dimMinusDomainDim, typename PointType>
        struct IntegrationList;
    
    template <typename PointType>
        struct IntegrationList<0,PointType> : public std::deque<PointType>
    {
//        static_assert(0,"NOT IMPLEMENTED YET");
    };
    
    
    template <typename PointType>
        struct IntegrationList<1,PointType> : public std::deque<PointType>
    {
        std::shared_ptr<const void> domainOwner;
        
        /**********************************************************************/
        template<typename IntegrationDomainType>
        IntegrationList(const IntegrationDomainType& domain):
            domainOwner(std::make_shared<IntegrationDomainType>(domain))
        {
            domain.validate();
            
            typedef typename IntegrationDomainType::ElementType ElementType;
            typedef typename IntegrationDomainType::QuadratureType QuadratureType;
            
//            std::cout<<"Creating surface IntegrationList (size "<<this->size()<<"->"<<std::flush;
//            const auto t0= std::chrono::system_clock::now();
            for (size_t k=0;k<domain.size();++k)
            {
                const ElementType& ele(*domain[k].first);  // element ID
                const int f(domain[k].second); //    face ID
                for(unsigned int q=0;q<QuadratureType::quadratureOrder;++q)
                {
                    const Eigen::Matrix<double,ElementType::dim,1>   faceBary(BarycentricTraits<ElementType::dim-1>::x2l(QuadratureType::abscissa(q)));
                    const Eigen::Matrix<double,ElementType::dim+1,1> domainBary(BarycentricTraits<ElementType::dim>::face2domainBary(faceBary,f));
                    this->emplace_back(ele,domainBary,f,QuadratureType::weight(q));
                }
                
            }
//            std::cout<<this->size()<<") ["<<(std::chrono::duration<double>(std::chrono::system_clock::now()-t0)).count()<<" sec]"<<std::endl;
        }
        
    };
    
    template <typename PointType>
    struct IntegrationList<2,PointType> : public std::deque<PointType>
    {
        
//        /**********************************************************************/
//        template<typename IntegrationDomainType>
//        IntegrationList(const IntegrationDomainType& domain)
//        {
//            
//            typedef typename IntegrationDomainType::ElementType ElementType;
//            typedef typename IntegrationDomainType::QuadratureType QuadratureType;
//            
//            std::cout<<"Creating IntegrationList (size "<<this->size()<<"->"<<std::flush;
//            const auto t0= std::chrono::system_clock::now();
//            for (size_t k=0;k<domain.size();++k)
//            {
//                const ElementType& ele(*domain[k].first);  // element ID
//                const int f(domain[k].second); //    face ID
//                for(unsigned int q=0;q<QuadratureType::quadratureOrder;++q)
//                {
//                    const Eigen::Matrix<double,ElementType::dim,1>   faceBary(BarycentricTraits<ElementType::dim-1>::x2l(QuadratureType::abscissa(q)));
//                    const Eigen::Matrix<double,ElementType::dim+1,1> domainBary(BarycentricTraits<ElementType::dim>::face2domainBary(faceBary,f));
//                    this->emplace_back(ele,domainBary,f,QuadratureType::weight(q));
//                }
//                
//            }
//            std::cout<<this->size()<<") ["<<(std::chrono::duration<double>(std::chrono::system_clock::now()-t0)).count()<<" sec]"<<std::endl;
//        }
        
    };
    
    
 
    
    
}       // close namespace
#endif