/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
*/
/*
simple bitmask class
*/
#pragma once
#include
#include
#include
template
class Bitmask {
static constexpr uint16_t NUMWORDS = ((NUMBITS+31)/32);
static_assert(NUMBITS > 0, "must store something");
// for first_set()'s return value
static_assert(NUMBITS <= INT16_MAX, "must fit in int16_t");
// so that 1U << bits is in range
static_assert(sizeof(unsigned int) >= sizeof(uint32_t), "int too small");
public:
Bitmask() {
clearall();
}
Bitmask &operator=(const Bitmask&other) {
memcpy(bits, other.bits, sizeof(bits[0])*NUMWORDS);
return *this;
}
bool operator==(const Bitmask&other) {
return memcmp(bits, other.bits, sizeof(bits[0])*NUMWORDS) == 0;
}
bool operator!=(const Bitmask&other) {
return !(*this == other);
}
Bitmask(const Bitmask &other) = delete;
// set given bitnumber
void set(uint16_t bit) {
if (!validate(bit)) {
return; // ignore access of invalid bit
}
uint16_t word = bit/32;
uint8_t ofs = bit & 0x1f;
bits[word] |= (1U << ofs);
}
// set all bits
void setall(void) {
// set all words to 111...
for (uint16_t i=0; i= NUMBITS) {
INTERNAL_ERROR(AP_InternalError::error_t::bitmask_range);
return false;
}
return true;
}
uint32_t bits[NUMWORDS];
};