/usr/include/dolfin/mesh/MeshHierarchy.h is in libdolfin-dev 2017.2.0.post0-2.
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 | // Copyright (C) 2015 Chris Richardson
//
// This file is part of DOLFIN.
//
// DOLFIN is free software: you can 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 3 of the License, or
// (at your option) any later version.
//
// DOLFIN 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 Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
//
#ifndef __MESH_HIERARCHY_H
#define __MESH_HIERARCHY_H
#include<vector>
#include<memory>
#include<dolfin/log/log.h>
namespace dolfin
{
class Mesh;
class MeshRelation;
template <typename T> class MeshFunction;
/// Experimental implementation of a list of Meshes as a hierarchy
class MeshHierarchy
{
public:
/// Constructor
MeshHierarchy()
{}
/// Constructor with initial mesh
explicit MeshHierarchy(std::shared_ptr<const Mesh> mesh)
: _meshes(1, mesh), _parent(NULL), _relation(NULL)
{}
/// Destructor
~MeshHierarchy()
{}
/// Number of meshes
unsigned int size() const
{ return _meshes.size(); }
/// Get Mesh i, in range [0:size()] where 0 is the coarsest Mesh.
std::shared_ptr<const Mesh> operator[](int i) const
{
if (i < 0)
i += _meshes.size();
dolfin_assert(i < (int)_meshes.size());
return _meshes[i];
}
/// Get the finest mesh of the MeshHierarchy
std::shared_ptr<const Mesh> finest() const
{ return _meshes.back(); }
/// Get the coarsest mesh of the MeshHierarchy
std::shared_ptr<const Mesh> coarsest() const
{ return _meshes.front(); }
/// Refine finest mesh of existing hierarchy, creating a new hierarchy
/// (level n -> n+1)
std::shared_ptr<const MeshHierarchy> refine
(const MeshFunction<bool>& markers) const;
/// Unrefine by returning the previous MeshHierarchy
/// (level n -> n-1)
/// Returns NULL for a MeshHierarchy containing a single Mesh
std::shared_ptr<const MeshHierarchy> unrefine() const
{ return _parent; }
/// Coarsen finest mesh by one level, based on markers (level n->n)
std::shared_ptr<const MeshHierarchy> coarsen
(const MeshFunction<bool>& markers) const;
/// Calculate the number of cells on the finest Mesh
/// which are descendents of each cell on the coarsest Mesh,
/// returning a vector over the cells of the coarsest Mesh.
std::vector<std::size_t> weight() const;
/// Rebalance across processes
std::shared_ptr<Mesh> rebalance() const;
private:
// Basic store of mesh pointers for easy access
std::vector<std::shared_ptr<const Mesh> > _meshes;
// Parent MeshHierarchy
std::shared_ptr<const MeshHierarchy> _parent;
// Intermesh relationship data, i.e. parent cell, facet, vertex mappings
// instead of using MeshData
std::shared_ptr<const MeshRelation> _relation;
};
}
#endif
|