bit_array.h

Go to the documentation of this file.

#ifndef _PFC_BIT_ARRAY_H_
#define _PFC_BIT_ARRAY_H_
namespace pfc {
    class NOVTABLE bit_array {
    public:
        virtual bool get(t_size n) const = 0;
        virtual t_size find(bool val,t_size start,t_ssize count) const
        {
            t_ssize d, todo, ptr = start;
            if (count==0) return start;
            else if (count<0) {d = -1; todo = -count;}
            else {d = 1; todo = count;}
            while(todo>0 && get(ptr)!=val) {ptr+=d;todo--;}
            return ptr;
        }
        inline bool operator[](t_size n) const {return get(n);}

        t_size calc_count(bool val,t_size start,t_size count,t_size count_max = ~0) const//counts number of vals for start<=n<start+count
        {
            t_size found = 0;
            t_size max = start+count;
            t_size ptr;
            for(ptr=find(val,start,count);found<count_max && ptr<max;ptr=find(val,ptr+1,max-ptr-1)) found++;
            return found;
        }

        inline t_size find_first(bool val,t_size start,t_size max) const {return find(val,start,max-start);}
        inline t_size find_next(bool val,t_size previous,t_size max) const {return find(val,previous+1,max-(previous+1));}
    protected:
        bit_array() {}
        ~bit_array() {}
    };

    class NOVTABLE bit_array_var : public bit_array {
    public:
        virtual void set(t_size n,bool val)=0;
    protected:
        bit_array_var() {}
        ~bit_array_var() {}
    };
}

typedef pfc::bit_array bit_array; //for compatibility
typedef pfc::bit_array_var bit_array_var; //for compatibility

class bit_array_wrapper_permutation : public bit_array {
public:
    bit_array_wrapper_permutation(const t_size * p_permutation, t_size p_size) : m_permutation(p_permutation), m_size(p_size) {}
    bool get(t_size n) const {
        if (n < m_size) {
            return m_permutation[n] != n;
        } else {
            return false;
        }
    }
private:
    const t_size * const m_permutation;
    const t_size m_size;
};


#define PFC_FOR_EACH_INDEX( bitArray, var, count ) \
for( size_t var = (bitArray).find_first( true, 0, (count) ); var < (count); var = (bitArray).find_next( true, var, (count) ) )

#endif