/usr/include/dolfin/mesh/MeshHierarchy.h is in libdolfin1.0-dev 1.0.0-1.
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 | // Copyright (C) 2006 Johan Hoffman
//
// 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/>.
//
// First added: 2006-12-20
// Last changed: 2006-12-20
#ifndef __MESHHIERARCHY_H
#define __MESHHIERARCHY_H
#include <dolfin/common/types.h>
namespace dolfin
{
class Mesh;
/// A MeshHierarchy is a set of Mesh objects M_k, each corresponding to
/// a refinement level k, for k=0,1,...,k_{max}.
/// M_k for k>0 contains mesh entities of codimension 0 that are not
/// contained in M_{k-1}, together with associated mesh entities of
/// codimension >0.
///
/// For example, the MeshHierarchy may correspond to a set of successively
/// refined finite element meshes T_k, k=0,1,...,k_{max}, where M_0
/// corresponds to cells, nodes and edges of an unrefined initial mesh T_0,
/// and M_k corresponds to the cells of the mesh T_k not contained in T_{k-1},
/// together with its nodes and edges.
class MeshHierarchy
{
public:
/// Create mesh hierarcy with initial mesh
MeshHierarchy(const Mesh& mesh);
/// Create empty mesh hierarcy
MeshHierarchy();
/// Destructor
~MeshHierarchy();
/// Initialize mesh hierarchy
void init(const Mesh& mesh);
/// Clear mesh hierarchy
void clear();
/// Return number of meshes in hierarchy
int size();
/// Add (finest) mesh to mesh hierarchy
void add(const Mesh& mesh);
/// Remove (finest) mesh from mesh hierarchy
void remove();
/// Return reduced mesh object corresponding to level k
Mesh& operator() (uint k) const;
/// Return full mesh object corresponding to level k
Mesh& operator[] (uint k) const;
private:
/// std::vector of meshes
Mesh* meshes;
/// Number of meshes in mesh hierarchy
uint num_meshes;
};
}
#endif
|