eval_subset.cc

Go to the documentation of this file.

/*!
 *
 * Copyright (C) 2015 Technical University of Liberec.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or modify it under
 * the terms of the GNU General Public License version 3 as published by the
 * Free Software Foundation. (http://www.gnu.org/licenses/gpl-3.0.en.html)
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
 *
 *
 * @file    eval_subset.cc
 * @brief
 * @author  David Flanderka
 */

#include "fields/eval_subset.hh"
#include "fields/eval_points.hh"
#include "fields/field_value_cache.hh"


/******************************************************************************
 * Implementation of BaseIntegral methods
 */

BaseIntegral::~BaseIntegral()
{}


/******************************************************************************
 * Implementation of BulkIntegral methods
 */

BulkIntegral::~BulkIntegral()
{}

Range< BulkPoint > BulkIntegral::points(const DHCellAccessor &cell, const ElementCacheMap *elm_cache_map) const {
    if (cell.element_cache_index() == ElementCacheMap::undef_elem_idx)
        THROW( ExcElementNotInCache() << EI_ElementIdx(cell.elm_idx()) );

    auto bgn_it = make_iter<BulkPoint>( BulkPoint(cell, elm_cache_map, shared_from_this(), eval_points_->subset_begin(dim_, subset_index_)) );
    auto end_it = make_iter<BulkPoint>( BulkPoint(cell, elm_cache_map, shared_from_this(), eval_points_->subset_end(dim_, subset_index_)) );
    return Range<BulkPoint>(bgn_it, end_it);
}


/******************************************************************************
 * Implementation of EdgeIntegral methods
 */

EdgeIntegral::EdgeIntegral(std::shared_ptr<EvalPoints> eval_points, unsigned int dim, unsigned int n_permutations, unsigned int points_per_side)
:  BaseIntegral(eval_points, dim), subset_index_(eval_points_->n_subsets(dim)), n_permutations_(n_permutations) {
    n_sides_ = dim_+1;
    perm_indices_ = new unsigned int** [n_sides_];
    for (unsigned int i_side=0; i_side<n_sides_; ++i_side) {
        perm_indices_[i_side] = new unsigned int* [n_permutations_];
        for (unsigned int i_perm=0; i_perm<n_permutations_; ++i_perm) {
            perm_indices_[i_side][i_perm] = new unsigned int [points_per_side];
        }
    }
}

EdgeIntegral::~EdgeIntegral() {
    for (unsigned int i_side=0; i_side<n_sides_; ++i_side) {
        for (unsigned int i_perm=0; i_perm<n_permutations_; ++i_perm) {
            delete perm_indices_[i_side][i_perm];
        }
        delete perm_indices_[i_side];
    }
    delete perm_indices_;
}

Range< EdgePoint > EdgeIntegral::points(const DHCellSide &cell_side, const ElementCacheMap *elm_cache_map) const {
    if (cell_side.cell().element_cache_index() == ElementCacheMap::undef_elem_idx)
        THROW( ExcElementNotInCache() << EI_ElementIdx(cell_side.cell().elm_idx()) );

    unsigned int begin_idx = eval_points_->subset_begin(dim_, subset_index_);
    unsigned int end_idx = eval_points_->subset_end(dim_, subset_index_);
    unsigned int points_per_side = (end_idx - begin_idx) / this->n_sides();
    auto bgn_it = make_iter<EdgePoint>( EdgePoint(cell_side, elm_cache_map, shared_from_this(), 0 ) );
    auto end_it = make_iter<EdgePoint>( EdgePoint(cell_side, elm_cache_map, shared_from_this(), points_per_side ) );
    return Range<EdgePoint>(bgn_it, end_it);
}


/******************************************************************************
 * Implementation of CouplingIntegral methods
 */

CouplingIntegral::CouplingIntegral(std::shared_ptr<EdgeIntegral> edge_integral, std::shared_ptr<BulkIntegral> bulk_integral)
 : BaseIntegral(edge_integral->eval_points(), edge_integral->dim()), edge_integral_(edge_integral), bulk_integral_(bulk_integral) {
    ASSERT_EQ_DBG(edge_integral->dim(), bulk_integral->dim());
}

CouplingIntegral::~CouplingIntegral() {
    edge_integral_.reset();
    bulk_integral_.reset();
}

Range< BulkPoint > CouplingIntegral::points(const DHCellAccessor &cell, const ElementCacheMap *elm_cache_map) const {
    return bulk_integral_->points(cell, elm_cache_map);
}

Range< EdgePoint > CouplingIntegral::points(const DHCellSide &cell_side, const ElementCacheMap *elm_cache_map) const {
    return edge_integral_->points(cell_side, elm_cache_map);
}



/******************************************************************************
 * Implementation of BoundaryIntegral methods
 */

BoundaryIntegral::BoundaryIntegral(std::shared_ptr<EdgeIntegral> edge_integral)
 : BaseIntegral(edge_integral->eval_points(), edge_integral->dim()), edge_integral_(edge_integral) {}

BoundaryIntegral::~BoundaryIntegral() {
    edge_integral_.reset();
}

Range< EdgePoint > BoundaryIntegral::points(const DHCellSide &cell_side, const ElementCacheMap *elm_cache_map) const {
    return edge_integral_->points(cell_side, elm_cache_map);
}


/******************************************************************************
 * Implementation of BulkPoint methods
 */


/******************************************************************************
 * Implementation of EdgePoint methods
 */

EdgePoint EdgePoint::permute(DHCellSide edg_side) const {
    return EdgePoint(edg_side, elm_cache_map_, this->integral_, this->local_point_idx_);
}