bit array macros

#define BIT_SET(array, bit) (array[bit / 8] |= (1 << (bit % 8)))
#define BIT_CLEAR(array, bit) (array[bit / 8] &= ~(1 << (bit % 8)))
#define BIT_GET(array, bit) ((array[bit / 8] | (1 << (bit % 8))) != 0)

uint8_t array[5];
bzero(array, sizeof(array);
BIT_SET(array, 18);
BIT_GET(array, 18);

Why don't just use std::bitset? :)

1. I don't like C++.
2. More important: this was a quickie example of how zero-based array indexing can be easier to work with.