bitset.h

Go to the documentation of this file.

#ifndef MSL_BITSET_H_
#define MSL_BITSET_H_
 
#include "stdio.h"
#include "stdlib.h"
#include "algorithm.h"
 
namespace std {
// TODO: where does this go?
inline void __msl_error(const char* param_0) {
    fprintf(stderr, param_0);
    abort();
}
 
template<size_t N> class __bitset_base {
public:
    __bitset_base();
 
    bool test(size_t pos) const;
    bool any() const;
    void set(size_t pos, bool val);
    void reset(size_t pos);
private:
    size_t data[N];
};
 
template<> class __bitset_base<1> {
public:
    __bitset_base() { data = 0; }
 
    bool test(size_t pos) const {
        u32 r31 = 1UL << pos;
        return data & r31;
    }
    bool any() const { return data != 0; }
    void set(size_t pos, bool val) {
        u32 r31 = 1UL << pos;
        if (val) {
            data |= r31;
        } else {
            data &= ~r31;
        }
    }
    void reset(size_t pos) { data &= ~(1UL << pos); }
private:
    size_t data;
};
 
template<size_t N> __bitset_base<N>::__bitset_base() {
    std::fill(data, data + N, 0);
}
 
template<size_t N> bool __bitset_base<N>::test(size_t pos) const {
    size_t i = pos / (sizeof(size_t) * 8);
    size_t mask = 1 << (pos % (sizeof(size_t) * 8));
    return data[i] & mask;
}
 
template<size_t N> void __bitset_base<N>::set(size_t pos, bool val) {
    size_t i = pos / (sizeof(size_t) * 8);
    size_t mask = 1 << (pos % (sizeof(size_t) * 8));
    if (val) {
        data[i] |= mask;
    } else {
        data[i] &= ~mask;
    }
}
 
template<size_t N> void __bitset_base<N>::reset(size_t pos) {
    size_t i = pos / (sizeof(size_t) * 8);
    size_t mask = 1 << (pos % (sizeof(size_t) * 8));
    data[i] &= ~mask;
}
 
template<size_t N> bool __bitset_base<N>::any() const {
    for (int i = 0; i < N; i++) {
        if (data[i] != 0) {
            return true;
        }
    }
    return false;
}
 
template<size_t N> class bitset : private __bitset_base<(N - 1) / (sizeof(size_t) * 8) + 1> {
public:
    typedef __bitset_base<(N - 1) / (sizeof(size_t) * 8) + 1> base;
 
    bitset() {};
 
    void set(size_t pos, bool val) {
        if (pos >= N) {
            __msl_error("index out of range of bitset::set");
        }
        base::set(pos, val);
    }
    void reset(size_t pos) {
        if (pos >= N) {
            __msl_error("index out of range of bitset::reset");
        }
        base::reset(pos);
    }
    bool test(size_t pos) const {
        if (pos >= N) {
            __msl_error("index out of range of bitset::test");
        }
        return base::test(pos);
    }
    bool any() const {
        return base::any();
    }
};
}  // namespace std
 
#endif