| 1 | /* | 
| 2 | * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. | 
| 3 | * | 
| 4 | * The University of Notre Dame grants you ("Licensee") a | 
| 5 | * non-exclusive, royalty free, license to use, modify and | 
| 6 | * redistribute this software in source and binary code form, provided | 
| 7 | * that the following conditions are met: | 
| 8 | * | 
| 9 | * 1. Acknowledgement of the program authors must be made in any | 
| 10 | *    publication of scientific results based in part on use of the | 
| 11 | *    program.  An acceptable form of acknowledgement is citation of | 
| 12 | *    the article in which the program was described (Matthew | 
| 13 | *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher | 
| 14 | *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented | 
| 15 | *    Parallel Simulation Engine for Molecular Dynamics," | 
| 16 | *    J. Comput. Chem. 26, pp. 252-271 (2005)) | 
| 17 | * | 
| 18 | * 2. Redistributions of source code must retain the above copyright | 
| 19 | *    notice, this list of conditions and the following disclaimer. | 
| 20 | * | 
| 21 | * 3. Redistributions in binary form must reproduce the above copyright | 
| 22 | *    notice, this list of conditions and the following disclaimer in the | 
| 23 | *    documentation and/or other materials provided with the | 
| 24 | *    distribution. | 
| 25 | * | 
| 26 | * This software is provided "AS IS," without a warranty of any | 
| 27 | * kind. All express or implied conditions, representations and | 
| 28 | * warranties, including any implied warranty of merchantability, | 
| 29 | * fitness for a particular purpose or non-infringement, are hereby | 
| 30 | * excluded.  The University of Notre Dame and its licensors shall not | 
| 31 | * be liable for any damages suffered by licensee as a result of | 
| 32 | * using, modifying or distributing the software or its | 
| 33 | * derivatives. In no event will the University of Notre Dame or its | 
| 34 | * licensors be liable for any lost revenue, profit or data, or for | 
| 35 | * direct, indirect, special, consequential, incidental or punitive | 
| 36 | * damages, however caused and regardless of the theory of liability, | 
| 37 | * arising out of the use of or inability to use software, even if the | 
| 38 | * University of Notre Dame has been advised of the possibility of | 
| 39 | * such damages. | 
| 40 | */ | 
| 41 |  | 
| 42 | #ifndef UTILS_BITSET_HPP | 
| 43 | #define UTILS_BITSET_HPP | 
| 44 |  | 
| 45 | #include <iostream> | 
| 46 | #include <vector> | 
| 47 | namespace oopse { | 
| 48 |  | 
| 49 | /** | 
| 50 | * @class OOPSEBitSet OOPSEBitSet.hpp "OOPSEBitSet.hpp" | 
| 51 | * @brief OOPSEBitSet is a wrapper class of std::vector<char> to act as a growable std::bitset | 
| 52 | */ | 
| 53 | class OOPSEBitSet { | 
| 54 | public: | 
| 55 | /** */ | 
| 56 | OOPSEBitSet() {} | 
| 57 | /** */ | 
| 58 | OOPSEBitSet(int nbits) : bitset_(nbits) {clearAll(); } | 
| 59 |  | 
| 60 | /** Returns the number of bits set to true in this OOPSEBitSet.  */ | 
| 61 | int countBits(); | 
| 62 |  | 
| 63 | /** Sets the bit at the specified index to to the complement of its current value. */ | 
| 64 | void flip(int bitIndex) {  bitset_[bitIndex] = !bitset_[bitIndex];  } | 
| 65 |  | 
| 66 | /** Sets each bit from the specified fromIndex(inclusive) to the specified toIndex(exclusive) to the complement of its current value. */ | 
| 67 | void flip(int fromIndex, int toIndex); | 
| 68 |  | 
| 69 | /** Sets each bit to the complement of its current value. */ | 
| 70 | void flip() { flip(0, size()); } | 
| 71 |  | 
| 72 | /** Returns the value of the bit with the specified index. */ | 
| 73 | bool get(int bitIndex) {  return bitset_[bitIndex];  } | 
| 74 |  | 
| 75 | /** Returns a new OOPSEBitSet composed of bits from this OOPSEBitSet from fromIndex(inclusive) to toIndex(exclusive). */ | 
| 76 | OOPSEBitSet get(int fromIndex, int toIndex); | 
| 77 |  | 
| 78 | /** Returns true if any bits are set to true */ | 
| 79 | bool any() {return !none(); } | 
| 80 |  | 
| 81 | /** Returns true if no bits are set to true */ | 
| 82 | bool none(); | 
| 83 |  | 
| 84 | int firstOffBit() const { return !bitset_[0] ? 0 : nextOffBit(0); } | 
| 85 |  | 
| 86 | /** Returns the index of the first bit that is set to false that occurs on or after the specified starting index.*/ | 
| 87 | int nextOffBit(int fromIndex) const; | 
| 88 |  | 
| 89 | int firstOnBit() const { return bitset_[0] ? 0 : nextOnBit(0); } | 
| 90 |  | 
| 91 | /** Returns the index of the first bit that is set to true that occurs on or after the specified starting index. */ | 
| 92 | int nextOnBit(int fromIndex) const; | 
| 93 |  | 
| 94 | /** Performs a logical AND of this target bit set with the argument bit set. */ | 
| 95 | void andOperator (const OOPSEBitSet& bs); | 
| 96 |  | 
| 97 | /** Performs a logical OR of this bit set with the bit set argument. */ | 
| 98 | void orOperator (const OOPSEBitSet& bs); | 
| 99 |  | 
| 100 | /** Performs a logical XOR of this bit set with the bit set argument. */ | 
| 101 | void xorOperator (const OOPSEBitSet& bs); | 
| 102 |  | 
| 103 | void setBitOn(int bitIndex) {  setBit(bitIndex, true);  } | 
| 104 |  | 
| 105 | void setBitOff(int bitIndex) {  setBit(bitIndex, false);  } | 
| 106 |  | 
| 107 | void setRangeOn(int fromIndex, int toIndex) {  setBits(fromIndex, toIndex, true);  } | 
| 108 |  | 
| 109 | void setRangeOff(int fromIndex, int toIndex) {  setBits(fromIndex, toIndex, false);  } | 
| 110 |  | 
| 111 | /** Sets all of the bits in this OOPSEBitSet to false. */ | 
| 112 | void clearAll() {  setRangeOff(0, size());  } | 
| 113 |  | 
| 114 | void setAll() {  setRangeOn(0, size());  } | 
| 115 |  | 
| 116 | /** Returns the number of bits of space actually in use by this OOPSEBitSet to represent bit values. */ | 
| 117 | int size() const {  return bitset_.size();  } | 
| 118 |  | 
| 119 | /** Changes the size of OOPSEBitSet*/ | 
| 120 | void resize(int nbits); | 
| 121 |  | 
| 122 | OOPSEBitSet& operator&= (const OOPSEBitSet &bs) {  andOperator (bs); return *this; } | 
| 123 | OOPSEBitSet& operator|= (const OOPSEBitSet &bs) { orOperator (bs); return *this; } | 
| 124 | OOPSEBitSet& operator^= (const OOPSEBitSet &bs) { xorOperator (bs); return *this; } | 
| 125 | OOPSEBitSet& operator-= (const OOPSEBitSet &bs) { | 
| 126 | OOPSEBitSet tmp = *this ^ bs; | 
| 127 | *this &= tmp; | 
| 128 | return *this; | 
| 129 | } | 
| 130 |  | 
| 131 | bool operator[] (int bitIndex)  const {  return bitset_[bitIndex];  } | 
| 132 | friend OOPSEBitSet operator| (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2); | 
| 133 | friend OOPSEBitSet operator& (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2); | 
| 134 | friend OOPSEBitSet operator^ (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2); | 
| 135 | friend OOPSEBitSet operator- (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2); | 
| 136 |  | 
| 137 | friend bool operator== (const OOPSEBitSet & bs1, const OOPSEBitSet &bs2); | 
| 138 |  | 
| 139 | //friend std::istream& operator>> ( std::istream&, const OOPSEBitSet& bs); | 
| 140 | friend std::ostream& operator<< ( std::ostream&, const OOPSEBitSet& bs) ; | 
| 141 |  | 
| 142 | private: | 
| 143 |  | 
| 144 | /** Sets the bit at the specified index to the specified value. */ | 
| 145 | void setBit(int bitIndex, bool value) { bitset_[bitIndex] = value; } | 
| 146 |  | 
| 147 | /** Sets the bits from the specified fromIndex(inclusive) to the specified toIndex(exclusive) to the specified value. */ | 
| 148 | void setBits(int fromIndex, int toIndex, bool value); | 
| 149 |  | 
| 150 | std::vector<char> bitset_; | 
| 151 | }; | 
| 152 |  | 
| 153 |  | 
| 154 | } | 
| 155 | #endif |