QP::QPSet Class Reference

Set of Active Objects of up to QF_MAX_ACTIVE elements. More...

#include "qp.hpp"

Public Member Functions
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

Private Attributes
QPSetBits	m_bits [((QF_MAX_ACTIVE+(8U *sizeof(QPSetBits))) - 1U)/(8U *sizeof(QPSetBits))]

Detailed Description

Set of Active Objects of up to QF_MAX_ACTIVE elements.

Details

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 607 of file qp.hpp.

Member Function Documentation

setEmpty()

void QP::QPSet::setEmpty ( )

inlinenoexcept

Make the priority set empty

Definition at line 612 of file qp.hpp.

isEmpty()

bool QP::QPSet::isEmpty ( ) const

inlinenoexcept

Find out whether the priority-set is empty.

Returns

'true' if the priority set is empty.

Definition at line 618 of file qp.hpp.

notEmpty()

bool 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 625 of file qp.hpp.

hasElement()

bool 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 632 of file qp.hpp.

insert()

void QP::QPSet::insert ( std::uint_fast8_t const n )

inlinenoexcept

Insert element n into the priority-set (n = 1..QF_MAX_ACTIVE)

Definition at line 641 of file qp.hpp.

remove()

void QP::QPSet::remove ( std::uint_fast8_t const n )

inlinenoexcept

Remove element n from the priority-set (n = 1..QF_MAX_ACTIVE)

Definition at line 653 of file qp.hpp.

findMax()

std::uint_fast8_t 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 665 of file qp.hpp.

update_()

void 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 676 of file qp.hpp.

verify_()

bool 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 685 of file qp.hpp.

Member Data Documentation

m_bits

QPSetBits QP::QPSet::m_bits[((QF_MAX_ACTIVE+(8U *sizeof(QPSetBits))) - 1U)/(8U *sizeof(QPSetBits))]

private

Bitmask with a bit for each element

Definition at line 609 of file qp.hpp.

---

The documentation for this class was generated from the following files:

• qp.hpp
• qp.dox