38 setMany(locations.
begin(), locations.
end());
61 const label len = addr.
size();
63 for (label i = 0; i < len; ++i)
73 template<
class InputIter>
77 const auto max = std::max_element(first, last);
78 const label len = (
max != last ? (1 + *
max) : 0);
86 for (; first != last; ++first)
99 template<
class InputIter>
104 for (; first != last; ++first)
119 return setMany(locations.
begin(), locations.
end());
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, auto-vivify entries if needed.
A 1D vector of objects of type <T> with a fixed length <N>.
iterator begin() noexcept
Return an iterator to begin traversing the FixedList.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
iterator end() noexcept
Return an iterator to end traversing the FixedList.
Base for lists with indirect addressing, templated on the list contents type and the addressing type...
void unset(List< bool > &bools, const labelUList &locations)
Unset the listed locations (assign 'false').
bitSet & unset(const bitSet &other)
Unset (subtract) the bits specified in the other bitset, which is a set difference corresponds to the...
label size() const noexcept
The number of elements in the list.
constexpr bitSet() noexcept
Default construct an empty, zero-sized bitSet.
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
triangles reserve(surf.size())
unsigned int get(const label i) const
Get value at index i or 0 for out-of-range.
bitSet bitset(const labelHashSet &locations)
Transform the on locations to a bitSet.