qpset.h

Go to the documentation of this file.

// Product: QF/C++
// Last Updated for Version: 4.0.00
// Date of the Last Update:  Apr 06, 2008
//
//                    Q u a n t u m     L e a P s
//                    ---------------------------
//                    innovating embedded systems
//
// Copyright (C) 2002-2008 Quantum Leaps, LLC. All rights reserved.
//
// This software may be distributed and modified under the terms of the GNU
// General Public License version 2 (GPL) as published by the Free Software
// Foundation and appearing in the file GPL.TXT included in the packaging of
// this file. Please note that GPL Section 2[b] requires that all works based
// on this software must also be made publicly available under the terms of
// the GPL ("Copyleft").
//
// Alternatively, this software may be distributed and modified under the
// terms of Quantum Leaps commercial licenses, which expressly supersede
// the GPL and are specifically designed for licensees interested in
// retaining the proprietary status of their code.
//
// Contact information:
// Quantum Leaps Web site:  http://www.quantum-leaps.com
// e-mail:                  info@quantum-leaps.com
#ifndef qpset_h
#define qpset_h


                      // external declarations of QF lookup tables used inline
extern uint8_t const Q_ROM Q_ROM_VAR QF_log2Lkup[256];
extern uint8_t const Q_ROM Q_ROM_VAR QF_pwr2Lkup[65];
extern uint8_t const Q_ROM Q_ROM_VAR QF_invPwr2Lkup[65];
extern uint8_t const Q_ROM Q_ROM_VAR QF_div8Lkup[65];

class QPSet8 {
    uint8_t m_bits;

public:

    uint8_t isEmpty(void) volatile {
        return (uint8_t)(m_bits == (uint8_t)0);
    }

    uint8_t notEmpty(void) volatile {
        return (uint8_t)(m_bits != (uint8_t)0);
    }

    uint8_t hasElement(uint8_t n) volatile {
        return (uint8_t)((m_bits & Q_ROM_BYTE(QF_pwr2Lkup[n])) != 0);
    }

    void insert(uint8_t n) volatile {
        m_bits |= Q_ROM_BYTE(QF_pwr2Lkup[n]);
    }

    void remove(uint8_t n) volatile {
        m_bits &= Q_ROM_BYTE(QF_invPwr2Lkup[n]);
    }

    uint8_t findMax(void) volatile {
        return Q_ROM_BYTE(QF_log2Lkup[m_bits]);
    }
};

class QPSet64 {

    uint8_t m_bytes;

    uint8_t m_bits[8];

public:

    uint8_t isEmpty(void) volatile {
        return (uint8_t)(m_bytes == (uint8_t)0);
    }

    uint8_t notEmpty(void) volatile {
        return (uint8_t)(m_bytes != (uint8_t)0);
    }

    uint8_t hasElement(uint8_t n) volatile {
        return (uint8_t)((m_bits[Q_ROM_BYTE(QF_div8Lkup[n])]
                 & Q_ROM_BYTE(QF_pwr2Lkup[Q_ROM_BYTE(QF_div8Lkup[n]) + 1]))
                != 0);
    }

    void insert(uint8_t n) volatile {
        m_bits[Q_ROM_BYTE(QF_div8Lkup[n])] |= Q_ROM_BYTE(QF_pwr2Lkup[n]);
        m_bytes |= Q_ROM_BYTE(QF_pwr2Lkup[Q_ROM_BYTE(QF_div8Lkup[n]) + 1]);
    }

    void remove(uint8_t n) volatile {
        m_bits[Q_ROM_BYTE(QF_div8Lkup[n])] &= Q_ROM_BYTE(QF_invPwr2Lkup[n]);
        if (m_bits[Q_ROM_BYTE(QF_div8Lkup[n])] == (uint8_t)0) {
            m_bytes &=
                Q_ROM_BYTE(QF_invPwr2Lkup[Q_ROM_BYTE(QF_div8Lkup[n]) + 1]);
        }
    }

    uint8_t findMax(void) volatile {
        uint8_t n = (uint8_t)(Q_ROM_BYTE(QF_log2Lkup[m_bytes]) - 1);
        return (uint8_t)((n << 3) + Q_ROM_BYTE(QF_log2Lkup[m_bits[n]]));
    }
};

#endif                                                              // qpset_h

---