72 inline label first_not_block()
const;
147 inline explicit
bitSet(const label
n);
150 inline
bitSet(const label
n, const
bool val);
207 inline
bitSet(const label
n, std::initializer_list<label> locations);
239 inline
bool all() const;
243 inline
bool any() const;
247 inline
bool none() const;
256 inline
unsigned int count(const
bool on=true) const;
266 inline
bool test(const label
pos) const;
271 inline
bool found(const label
pos) const;
316 inline
void fill(const
bool val);
370 inline
void flip(const label
pos);
416 template<class InputIter>
417 label
setMany(InputIter first, InputIter last);
443 template<class InputIter>
444 label
unset(InputIter first, InputIter last);
495 inline void operator=(
const unsigned int val);
498 inline operator unsigned int ()
const;
566 inline
unsigned int operator[](const label i) const;
616 void assign(
const unsigned int val) { this->
fill(val); }
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....
A helper class for outputting values to Ostream.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
A dynamic list of packed unsigned integers, with the number of bits per item specified by the <Width>...
friend Ostream & operator(Ostream &os, const InfoProxy< PackedList< Width > > &info)
Pointer management similar to std::unique_ptr, with some additional methods and type checking.
A const_iterator for iterating across on values.
const_iterator & operator++()
Move to the next on position.
bool operator!=(const const_iterator &iter) const noexcept
bool operator==(const const_iterator &iter) const noexcept
label operator*() const noexcept
Return the current on position.
A reference supporting read/write access to an entry.
reference(const reference &)=default
Copy construct.
reference(reference &&)=default
Move construct.
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
unsigned int count(const bool on=true) const
Count number of bits set.
void fill(const bool val)
Assign all entries to the given value.
const_iterator cbegin() const
Iterator set to the position of the first on bit.
unsigned int const_reference
void flip()
Invert all bits in the addressable region.
label find_last() const
Locate the last bit set.
labelList sortedToc() const
The indices of the on bits as a sorted labelList.
ClassName("bitSet")
Declare type-name (with debug switch)
static const bitSet & null()
Return a null bitSet reference.
const_iterator end() const noexcept
Iterator beyond the end of the bitSet.
void set(const bitSet &bitset)
Set specified bits from another bitset.
void transfer(bitSet &bitset)
bool none() const
True if no bits in this bitset are set.
autoPtr< bitSet > clone() const
Clone.
bool test(const label pos) const
Test value at specified position, never auto-vivify entries.
bitSet & bound(const label maxSize)
Ensure the addressable range does not exceed maxSize.
label find_first_not() const
Locate the first bit that is unset.
bitSet & xorEq(const bitSet &other)
The set logical XOR.
InfoProxy< bitSet > info() const
Return info proxy.
bool all() const
True if all bits in this bitset are set or if the set is empty.
labelList toc() const
The indices of the on bits as a sorted labelList.
const_iterator begin() const
Iterator set to the position of the first on bit.
void assign(const UList< bool > &bools)
Copy assign all entries from a list of bools.
void resize_last()
Resize to include the last on bit only.
bitSet() noexcept
Default construct an empty, zero-sized bitSet.
List< bool > values() const
Return the bitset values as a boolList.
bitSet & andEq(const bitSet &other)
The set logical AND.
bitSet & orEq(const bitSet &other)
The set logical OR.
bitSet & unset(const bitSet &other)
void swap(bitSet &bitset)
Swap contents.
label setMany(InputIter first, InputIter last)
const_iterator cend() const noexcept
Iterator beyond the end of the bitSet.
bool intersects(const bitSet &other) const
True if any bits in the other bitset intersect (are the same).
label find_next(label pos) const
Locate the next bit set, starting one beyond the specified position.
bitSet & minusEq(const bitSet &other)
The set difference.
bool any() const
True if any bits in this bitset are set.
bitSet & extend(const label minSize)
Ensure that minSize is covered by the bitSet.
label find_first() const
Locate the first bit that is set.
bitSet & operator=(const bitSet &bitset)
Copy assignment.
A range or interval of labels defined by a start and a size.
Macro definitions for declaring ClassName(), NamespaceName(), etc.
#define ClassName(TypeNameString)
Add typeName information from argument TypeNameString to a class.
OBJstream os(runTime.globalPath()/outputName)
tmp< faMatrix< Type > > operator-(const faMatrix< Type > &)
Unary negation.
bitSet operator~(const bitSet &bitset)
Bitset complement, returns a copy of the bitset with all its bits flipped.
dimensionedScalar pos(const dimensionedScalar &ds)
bitSet operator|(const bitSet &a, const bitSet &b)
Bitwise-OR of two bitsets.
tmp< GeometricField< Type, fvPatchField, volMesh > > operator&(const fvMatrix< Type > &, const DimensionedField< Type, volMesh > &)
Ostream & operator<<(Ostream &, const boundaryPatch &p)
Write boundaryPatch as dictionary entries (without surrounding braces)
bitSet operator^(const bitSet &a, const bitSet &b)
Bitwise-XOR of two bitsets to form a unique bit-set.
Hash function class. The default definition is for primitives. Non-primitives used to hash entries on...
Hashing functor for PackedList.
const Vector< label > N(dict.get< Vector< label > >("N"))