/usr/include/dolfin/mesh/SubsetIterator.h is in libdolfin1.3-dev 1.3.0+dfsg-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 | // Copyright (C) 2010 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/>.
//
// Modified by Andre Massing 2011.
//
// First added: 2010-11-17
// Last changed: 2011-11-10
#ifndef __SUBSET_ITERATOR_H
#define __SUBSET_ITERATOR_H
#include <vector>
#include<boost/shared_ptr.hpp>
#include <dolfin/log/log.h>
#include "Mesh.h"
#include "MeshEntity.h"
#include "MeshEntityIterator.h"
#include "MeshFunction.h"
namespace dolfin
{
/// A _SubsetIterator_ is similar to a _MeshEntityIterator_ but
/// iterates over a specified subset of the range of entities as
/// specified by a _MeshFunction_ that labels the entites.
class SubsetIterator
{
public:
/// Create iterator for given mesh function. The iterator visits
/// all entities that match the given label.
SubsetIterator(const MeshFunction<std::size_t>& labels, std::size_t label)
: _entity(*labels.mesh(), labels.dim(), 0),
_subset(new std::vector<std::size_t>()), subset(*_subset)
{
// Extract subset
subset.clear();
for (MeshEntityIterator entity(*labels.mesh(), labels.dim());
!entity.end(); ++entity)
{
if (labels[*entity] == label)
subset.push_back(entity->index());
}
info("Iterating over subset, found %d entities out of %d.",
subset.size(), labels.size());
// Set iterator
it = subset.begin();
}
/// Copy Constructor
SubsetIterator(const SubsetIterator& subset_iter)
: _entity(subset_iter._entity), _subset(subset_iter._subset),
subset(*_subset), it(subset_iter.it)
{}
/// Destructor
virtual ~SubsetIterator() {}
/// Step to next mesh entity (prefix increment)
SubsetIterator& operator++()
{
++it;
return *this;
}
/// Comparison operator
bool operator==(const SubsetIterator& sub_iter) const
{
return ((const_cast<SubsetIterator *>(this))->operator*()
== (const_cast<SubsetIterator *>(&sub_iter))->operator*()
&& it == sub_iter.it && &subset == &sub_iter.subset);
}
/// Comparison operator
bool operator!=(const SubsetIterator & sub_iter) const
{ return !operator==(sub_iter); }
/// Dereference operator
MeshEntity& operator*()
{ return *operator->(); }
/// Member access operator
MeshEntity* operator->()
{ _entity._local_index = *it; return &_entity; }
/// Check if iterator has reached the end
bool end() const
{ return it == subset.end(); }
SubsetIterator end_iterator()
{
SubsetIterator sg(*this);
sg.set_end();
return sg;
}
private:
/// Set pos to end position. To create a kind of mesh.end() iterator.
void set_end()
{ it = subset.end(); }
// Mesh entity
MeshEntity _entity;
// Subset in shared data form
boost::shared_ptr< std::vector<std::size_t> > _subset;
//Subset reference for convenience / speed
std::vector<std::size_t> & subset;
// Iterator
std::vector<std::size_t>::iterator it;
};
}
#endif
|