Go to the documentation of this file.
55 const label len = select.
size();
60 for (label i = 0; i < len; ++i)
83 auto const max = std::max_element(locations.
begin(), locations.
end());
84 const label len = (
max != locations.
end() ? (1 + *
max) : 0);
93 for (
const label i : locations)
label find_first() const
Locate the first bit that is set.
static Ostream & output(Ostream &os, const IntRange< T > &range)
List< bool > bools(const labelHashSet &locations)
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
bool any() const
True if any bits in this bitset are set.
bitSet bitset(const labelHashSet &locations)
Transform the on locations to a bitSet.
unsigned int count(const bool on=true) const
Count number of bits set.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
label find_next(label pos) const
Locate the next bit set, starting one beyond the specified position.
labelHashSet used(const bitSet &select)
Convert a bitset to a labelHashSet of the indices used.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
void size(const label n)
Older name for setAddressableSize.