/usr/include/dolfin/common/RangedIndexSet.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 | // Copyright (C) 2012 Joachim B Haga
//
// 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: 2012-03-02
// Last changed: 2012-03-02
#ifndef __RANGED_INDEX_SET_H
#define __RANGED_INDEX_SET_H
#include <cstddef>
#include <vector>
#include <dolfin/log/log.h>
namespace dolfin
{
/// This class provides an special-purpose data structure for testing if a given
/// index within a range is set. It is very fast.
///
/// The memory requirements are one bit per item in range, since it uses a
/// (packed) std::vector<bool> for storage.
class RangedIndexSet
{
public:
/// Create a ranged set with range given as a (lower, upper) pair.
RangedIndexSet(std::pair<std::size_t, std::size_t> range)
: _range(range), _is_set(range.second - range.first)
{
clear();
}
/// Create a ranged set with 0 as lower range
RangedIndexSet(std::size_t upper_range)
: _range(std::pair<std::size_t, std::size_t>(0, upper_range)), _is_set(upper_range)
{
clear();
}
/// Return true if a given index is within range, i.e., if it can be stored in the set.
bool in_range(std::size_t i) const
{
return (i >= _range.first && i < _range.second);
}
/// Check is the set contains the given index.
bool has_index(std::size_t i) const
{
dolfin_assert(in_range(i));
return _is_set[i - _range.first];
}
/// Insert a given index into the set. Returns true if the index was
/// inserted (i.e., the index was not already in the set).
bool insert(std::size_t i)
{
dolfin_assert(in_range(i));
std::vector<bool>::reference entry = _is_set[i - _range.first];
if (entry)
{
return false;
}
else
{
entry = true;
return true;
}
}
/// Erase an index from the set.
void erase(std::size_t i)
{
dolfin_assert(in_range(i));
_is_set[i - _range.first] = false;
}
/// Erase all indices from the set.
void clear()
{
std::fill(_is_set.begin(), _is_set.end(), false);
}
private:
const std::pair<std::size_t, std::size_t> _range;
std::vector<bool> _is_set;
};
}
#endif
|