/usr/include/deal.II/distributed/grid_refinement.h is in libdeal.ii-dev 8.5.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 | // ---------------------------------------------------------------------
//
// Copyright (C) 2009 - 2016 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------
#ifndef dealii__distribute_grid_refinement_h
#define dealii__distribute_grid_refinement_h
#include <deal.II/base/config.h>
#include <deal.II/base/exceptions.h>
#include <deal.II/distributed/tria.h>
#include <vector>
#include <limits>
DEAL_II_NAMESPACE_OPEN
namespace parallel
{
namespace distributed
{
/**
* Collection of functions controlling refinement and coarsening of
* parallel::distributed::Triangulation objects. This namespace provides
* similar functionality to the dealii::GridRefinement namespace, except
* that it works for meshes that are parallel and distributed.
*
* @ingroup grid
* @author Wolfgang Bangerth, 2009
*/
namespace GridRefinement
{
/**
* Like dealii::GridRefinement::refine_and_coarsen_fixed_number, but for
* parallel distributed triangulations.
*
* The vector of criteria needs to be a vector of refinement criteria
* for all cells active on the current triangulation, i.e.,
* it needs to be of length <code>tria.n_active_cells()</code> (and not
* <code>tria.n_locally_owned_active_cells()</code>). In other words,
* the vector needs to include entries for ghost and artificial
* cells. However, the current
* function will only look at the indicators that correspond to those
* cells that are actually locally owned, and ignore the indicators for
* all other cells. The function will then coordinate among all
* processors that store part of the triangulation so that at the end
* a fraction @p top_fraction_of_cells of all Triangulation::n_global_active_cells()
* active cells are refined, rather than a fraction of the
* Triangulation::n_locally_active_cells on each processor individually.
* In other words, it may be that on some processors, no cells are
* refined at all.
*
* The same is true for the fraction of cells that is coarsened.
*/
template <int dim, class VectorType, int spacedim>
void
refine_and_coarsen_fixed_number
(parallel::distributed::Triangulation<dim,spacedim> &tria,
const VectorType &criteria,
const double top_fraction_of_cells,
const double bottom_fraction_of_cells,
const unsigned int max_n_cells = std::numeric_limits<unsigned int>::max());
/**
* Like dealii::GridRefinement::refine_and_coarsen_fixed_fraction, but
* for parallel distributed triangulations.
*
* The vector of criteria needs to be a vector of refinement criteria
* for all cells active on the current triangulation, i.e.,
* it needs to be of length <code>tria.n_active_cells()</code> (and not
* <code>tria.n_locally_owned_active_cells()</code>). In other words,
* the vector needs to include entries for ghost and artificial
* cells. However, the current
* function will only look at the indicators that correspond to those
* cells that are actually locally owned, and ignore the indicators for
* all other cells. The function will then coordinate among all
* processors that store part of the triangulation so that at the end
* the smallest fraction of Triangulation::n_global_active_cells (not
* Triangulation::n_locally_owned_active_cells() on each processor individually)
* is refined that together make up a total of @p top_fraction_of_error
* of the total error. In other words, it may be that on some
* processors, no cells are refined at all.
*
* The same is true for the fraction of cells that is coarsened.
*/
template <int dim, class VectorType, int spacedim>
void
refine_and_coarsen_fixed_fraction
(parallel::distributed::Triangulation<dim,spacedim> &tria,
const VectorType &criteria,
const double top_fraction_of_error,
const double bottom_fraction_of_error);
}
}
}
DEAL_II_NAMESPACE_CLOSE
#endif //dealii__distributed_grid_refinement_h
|