41 for (label i =
select.find_first(); i >= 0; i =
select.find_next(i))
58 for (label i = 0; i < len; ++i)
73 output.setMany(locations.begin(), locations.end());
81 auto const max = std::max_element(locations.
begin(), locations.
end());
82 const label len = (
max != locations.
end() ? (1 + *
max) : 0);
89 List<bool>
output(len,
false);
91 for (
const label i : locations)
void size(const label n)
Older name for setAddressableSize.
labelHashSet used(const bitSet &select)
Convert a bitset to a labelHashSet of the indices used.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
List< bool > select(const label n, const labelUList &locations)
Construct a selection list of bools (all false) with the given pre-size, subsequently add specified l...
HashSet< label, Hash< label > > labelHashSet
A HashSet of labels, uses label hasher.
List< bool > bools(const labelHashSet &locations)
Transform the on locations to a boolList, with true for each non-negative location and false for all ...
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
static Ostream & output(Ostream &os, const IntRange< T > &range)
bitSet bitset(const labelHashSet &locations)
Transform the on locations to a bitSet.