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