/usr/include/dolfin/mesh/MeshConnectivity.h is in libdolfin-dev 2016.2.0-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 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 | // Copyright (C) 2006-2007 Anders Logg
//
// 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-05-09
// Last changed: 2010-11-28
#ifndef __MESH_CONNECTIVITY_H
#define __MESH_CONNECTIVITY_H
#include <vector>
#include <dolfin/log/log.h>
namespace dolfin
{
/// Mesh connectivity stores a sparse data structure of connections
/// (incidence relations) between mesh entities for a fixed pair of
/// topological dimensions.
///
/// The connectivity can be specified either by first giving the
/// number of entities and the number of connections for each entity,
/// which may either be equal for all entities or different, or by
/// giving the entire (sparse) connectivity pattern.
class MeshConnectivity
{
public:
/// Create empty connectivity between given dimensions (d0 -- d1)
MeshConnectivity(std::size_t d0, std::size_t d1);
/// Copy constructor
MeshConnectivity(const MeshConnectivity& connectivity);
/// Destructor
~MeshConnectivity();
/// Assignment
const MeshConnectivity& operator= (const MeshConnectivity& connectivity);
/// Return true if the total number of connections is equal to zero
bool empty() const
{ return _connections.empty(); }
/// Return total number of connections
std::size_t size() const
{ return _connections.size(); }
/// Return number of connections for given entity
std::size_t size(std::size_t entity) const
{
return (entity + 1) < index_to_position.size()
? index_to_position[entity + 1] - index_to_position[entity] : 0;
}
/// Return global number of connections for given entity
std::size_t size_global(std::size_t entity) const
{
if (_num_global_connections.empty())
return size(entity);
else
{
dolfin_assert(entity < _num_global_connections.size());
return _num_global_connections[entity];
}
}
/// Return array of connections for given entity
const unsigned int* operator() (std::size_t entity) const
{
return (entity + 1) < index_to_position.size()
? &_connections[index_to_position[entity]] : 0;
}
/// Return contiguous array of connections for all entities
const std::vector<unsigned int>& operator() () const
{ return _connections; }
/// Clear all data
void clear();
/// Initialize number of entities and number of connections (equal
/// for all)
void init(std::size_t num_entities, std::size_t num_connections);
/// Initialize number of entities and number of connections
/// (individually)
void init(std::vector<std::size_t>& num_connections);
/// Set given connection for given entity
void set(std::size_t entity, std::size_t connection, std::size_t pos);
/// Set all connections for given entity. T is a contains,
/// e.g. std::vector<std::size_t>
template<typename T>
void set(std::size_t entity, const T& connections)
{
dolfin_assert((entity + 1) < index_to_position.size());
dolfin_assert(connections.size()
== index_to_position[entity + 1]-index_to_position[entity]);
// Copy data
std::copy(connections.begin(), connections.end(),
_connections.begin() + index_to_position[entity]);
}
/// Set all connections for given entity
void set(std::size_t entity, std::size_t* connections);
/// Set all connections for all entities (T is a '2D' container, e.g. a
/// std::vector<<std::vector<std::size_t>>,
/// std::vector<<std::set<std::size_t>>, etc)
template <typename T>
void set(const T& connections)
{
// Clear old data if any
clear();
// Initialize offsets and compute total size
index_to_position.resize(connections.size() + 1);
std::int32_t size = 0;
for (std::size_t e = 0; e < connections.size(); e++)
{
index_to_position[e] = size;
size += connections[e].size();
}
index_to_position[connections.size()] = size;
// Initialize connections
_connections.reserve(size);
for (auto e = connections.begin(); e != connections.end(); ++e)
_connections.insert(_connections.end(), e->begin(), e->end());
_connections.shrink_to_fit();
}
/// Set global number of connections for all local entities
void
set_global_size(const std::vector<unsigned int>& num_global_connections)
{
dolfin_assert(num_global_connections.size()
== index_to_position.size() - 1);
_num_global_connections = num_global_connections;
}
/// Hash of connections
std::size_t hash() const;
/// Return informal string representation (pretty-print)
std::string str(bool verbose) const;
private:
// Dimensions (only used for pretty-printing)
std::size_t _d0, _d1;
// Connections for all entities stored as a contiguous array
std::vector<unsigned int> _connections;
// Global number of connections for all entities (possibly not
// computed)
std::vector<unsigned int> _num_global_connections;
// Position of first connection for each entity (using local index)
std::vector<unsigned int> index_to_position;
};
}
#endif
|