Go to the documentation of this file.
62 const label len = addr.
size();
64 for (label i = 0; i < len; ++i)
74 template<
class InputIter>
78 const auto max = std::max_element(first, last);
79 const label len = (
max != last ? (1 + *
max) : 0);
87 for (; first != last; ++first)
100 template<
class InputIter>
105 for (; first != last; ++first)
120 return setMany(locations.
begin(), locations.
end());
127 return unset(locations.
begin(), locations.
end());
bitSet() noexcept
Default construct an empty, zero-sized set.
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
iterator begin()
Return an iterator to begin traversing the FixedList.
bitSet & unset(const bitSet &other)
void set(const bitSet &bitset)
Set specified bits from another bitset.
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 get(const label i) const
Get value at index i or 0 for out-of-range.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
iterator end()
Return an iterator to end traversing the FixedList.
A 1D vector of objects of type <T> with a fixed length <N>.
Base for lists with indirect addressing, templated on the list contents type and the addressing type....
label size() const
The number of elements in the list.