Set of Active Objects of up to QF_MAX_ACTIVE elements.
More...
#include "qp.hpp"
|
void | setEmpty () noexcept |
|
bool | isEmpty () const noexcept |
|
bool | notEmpty () const noexcept |
|
bool | hasElement (std::uint_fast8_t const n) const noexcept |
|
void | insert (std::uint_fast8_t const n) noexcept |
|
void | remove (std::uint_fast8_t const n) noexcept |
|
std::uint_fast8_t | findMax () const noexcept |
|
void | update_ (QPSet *const dis) const noexcept |
|
bool | verify_ (QPSet const *const dis) const noexcept |
|
Set of Active Objects of up to QF_MAX_ACTIVE elements.
- Description
- QPSet represents the set of Active Objects in the priority order. The set is capable of storing up to QF_MAX_ACTIVE elements.
Definition at line 612 of file qp.hpp.
◆ setEmpty()
Make the priority set empty
Definition at line 617 of file qp.hpp.
◆ isEmpty()
Find out whether the priority-set is empty.
- Returns
- 'true' if the priority set is empty.
Definition at line 623 of file qp.hpp.
◆ notEmpty()
QP::QPSet::notEmpty |
( |
| ) |
const |
|
inlinenoexcept |
Find out whether the priority-set is NOT empty.
- Returns
- 'true' if the priority set is NOT empty.
Definition at line 630 of file qp.hpp.
◆ hasElement()
QP::QPSet::hasElement |
( |
std::uint_fast8_t const | n | ) |
const |
|
inlinenoexcept |
Find out whether the priority-set has element n
.
- Returns
- 'true' if the priority set has the element
n
.
Definition at line 637 of file qp.hpp.
◆ insert()
QP::QPSet::insert |
( |
std::uint_fast8_t const | n | ) |
|
|
inlinenoexcept |
◆ remove()
QP::QPSet::remove |
( |
std::uint_fast8_t const | n | ) |
|
|
inlinenoexcept |
◆ findMax()
QP::QPSet::findMax |
( |
| ) |
const |
|
inlinenoexcept |
Find the maximum element in the set, returns zero if the set is empty.
- Returns
- The current maximum element
n
.
Definition at line 670 of file qp.hpp.
◆ update_()
QP::QPSet::update_ |
( |
QPSet *const | dis | ) |
const |
|
inlinenoexcept |
Update the Duplicate Inverse Storage of QPSet (QP FuSa Subsystem)
- Parameters
-
[in,out] | dis | pointer to the duplicate inverse storage |
Definition at line 681 of file qp.hpp.
◆ verify_()
QP::QPSet::verify_ |
( |
QPSet const *const | dis | ) |
const |
|
inlinenoexcept |
Verify the Duplicate Inverse Storage (QP FuSa Subsystem)
- Parameters
-
[in] | dis | pointer to the duplicate inverse storage |
- Returns
- 'true' if this set matches the inverse copy and 'false' otherwise.
Definition at line 690 of file qp.hpp.
◆ m_bits
Bitmask with a bit for each element
Definition at line 614 of file qp.hpp.
The documentation for this class was generated from the following files: