Go to the documentation of this file.
60 for (
label i = 0; i < len; ++i)
83 auto const max = std::max_element(locations.
begin(), locations.
end());
93 for (
const label i : locations)
label find_first() const
Locate the first bit that is set.
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.
label setMany(InputIter first, InputIter last)
Set the locations listed by the iterator range,.
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.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
void resize(const label sz)
Resize the hash table for efficiency.
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...
bool insert(const Key &key)
Insert a new entry, not overwriting existing entries.
void size(const label n) noexcept
Override size to be inconsistent with allocated storage.