#ifndef FILE_BitArray #define FILE_BitArray /**************************************************************************/ /* File: bitarray.hpp */ /* Author: Joachim Schoeberl */ /* Date: 01. Jun. 95 */ /**************************************************************************/ #include namespace netgen { /** data type NgBitArray NgBitArray is a compressed array of Boolean information. By Set and Clear the whole array or one bit can be set or reset, respectively. Test returns the state of the occurring bit. No range checking is done. index ranges from 0 to size-1 */ class NgBitArray { INDEX size; unsigned char * data; public: DLL_HEADER NgBitArray (); /// DLL_HEADER NgBitArray (INDEX asize); /// DLL_HEADER ~NgBitArray (); /// DLL_HEADER void SetSize (INDEX asize); /// INDEX Size () const { return size; } /// DLL_HEADER void Set (); /// void Set (INDEX i) { data[Addr(i)] |= Mask(i); } DLL_HEADER void Clear (); void Clear (INDEX i) { data[Addr(i)] &= ~Mask(i); } bool Test (INDEX i) const { return (data[i / CHAR_BIT] & (char(1) << (i % CHAR_BIT) ) ) ? true : false; } /// void Invert (); /// void And (const NgBitArray & ba2); /// void Or (const NgBitArray & ba2); private: /// inline unsigned char Mask (INDEX i) const { return char(1) << (i % CHAR_BIT); } /// inline INDEX Addr (INDEX i) const { return (i / CHAR_BIT); } /// NgBitArray & operator= (NgBitArray &); /// NgBitArray (const NgBitArray &); }; // print bitarray inline ostream & operator<< (ostream & s, const NgBitArray & a) { for (int i = 1; i <= a.Size(); i++) { s << int (a.Test(i)); if (i % 40 == 0) s << "\n"; } if (a.Size() % 40 != 0) s << "\n"; return s; } /* inline INDEX NgBitArray :: Size () const { return size; } inline unsigned char NgBitArray :: Mask (INDEX i) const { return char(1) << (i % CHAR_BIT); } inline INDEX NgBitArray :: Addr (INDEX i) const { return (i / CHAR_BIT); } inline void NgBitArray :: Set (INDEX i) { data[Addr(i)] |= Mask(i); } inline void NgBitArray :: Clear (INDEX i) { data[Addr(i)] &= ~Mask(i); } inline int NgBitArray :: Test (INDEX i) const { return (data[i / CHAR_BIT] & (char(1) << (i % CHAR_BIT) ) ) ? 1 : 0; } */ } #endif