fairness/priority__t_8hpp_source.html

#ifndef BOOST_FAIRNESS_PRIORITY_T_HPP

#define BOOST_FAIRNESS_PRIORITY_T_HPP

#include <cstdint>

namespace boost::fairness{

    using Priority_t = uint8_t;

    #define BOOST_FAIRNESS_MAXIMUM_PRIORITY Priority_t(-1)

    #define BOOST_FAIRNESS_INVALID_PRIORITY Priority_t(-1)

    #define BOOST_FAIRNESS_MINIMUM_PRIORITY 0


    inline bool is_valid_priority(Priority_t const p){

        return p >= BOOST_FAIRNESS_MINIMUM_PRIORITY && p < BOOST_FAIRNESS_MAXIMUM_PRIORITY;

    }


} // namespace boost::fairness

#endif // BOOST_FAIRNESS_PRIORITY_T_HPP

boost::fairness
Definition acquisition_modes.hpp:16

boost::fairness::Priority_t
uint8_t Priority_t
Definition priority_t.hpp:17

boost::fairness::is_valid_priority
bool is_valid_priority(Priority_t const p)
allows you to verify that an input priority is valid. Has to be in the range [BOOST_FAIRNESS_MINIMUM_...
Definition priority_t.hpp:45

BOOST_FAIRNESS_MAXIMUM_PRIORITY
#define BOOST_FAIRNESS_MAXIMUM_PRIORITY
Priorities are indexes in an array, that means that if I define a priority_mutex<BOOST_FAIRNESS_MAXIM...
Definition priority_t.hpp:24

BOOST_FAIRNESS_MINIMUM_PRIORITY
#define BOOST_FAIRNESS_MINIMUM_PRIORITY
Priorities are indexes in an array, that means that if I define a priority_mutex<BOOST_FAIRNESS_MAXIM...
Definition priority_t.hpp:36