src/utils/BitSet.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 */

#include <algorithm>
#include <cassert>
#include <string>

#include "utils/BitSet.hpp"
#include "utils/Algorithm.hpp"

namespace oopse {
int BitSet::countBits() {
#ifdef __RWSTD    
    //For the compiler(Sun, MSVC6.0) binding with RougeWave STL Library, we need to use old-style
    // std::count which is error-prone.
    int count = 0;
    std::count(bitset_.begin(), bitset_.end(), true, count);
    return count;
#else
    return std::count(bitset_.begin(), bitset_.end(), true);
#endif
}

void BitSet::flip(int fromIndex, int toIndex) {
    assert(fromIndex <= toIndex);
    assert(fromIndex >=0);
    assert(toIndex <= size());
    std::vector<char>::iterator first = bitset_.begin() + fromIndex;
    std::vector<char>::iterator last = bitset_.begin() + toIndex;

    std::transform(first, last, first, std::logical_not<bool>());
        
}

BitSet BitSet::get(int fromIndex, int toIndex) {
    assert(fromIndex <= toIndex);
    assert(fromIndex >=0);
    assert(toIndex <= size());
    std::vector<char>::iterator first = bitset_.begin() + fromIndex;
    std::vector<char>::iterator last = bitset_.begin() + toIndex;

    BitSet result;
    std::copy(first, last, std::back_inserter(result.bitset_));
    return result;
}

bool BitSet::none() {
    std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
    return i == bitset_.end() ? true : false;
}
    
int BitSet::nextOffBit(int fromIndex) const {
    if (fromIndex <= -1) {
        //in case -1 or other negative number is passed to this function
        return -1;
    }
    
    ++fromIndex;
    while (fromIndex < size()) {
        if (!bitset_[fromIndex]) {
            return fromIndex;
        }
        ++fromIndex;
    }

    return -1;
}

int BitSet::nextOnBit(int fromIndex) const {
    if (fromIndex <= -1) {
        //in case -1 or other negative number is passed to this function
        return -1;
    }

    ++fromIndex;
    while (fromIndex < size()) {
        if (bitset_[fromIndex]) {
            return fromIndex;
        }
        ++fromIndex;
    }

    return -1;
}

void BitSet::andOperator (const BitSet& bs) {
    assert(size() == bs.size());

    std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_and<bool>());
}

void BitSet::orOperator (const BitSet& bs) {
    assert(size() == bs.size());
    std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_or<bool>());    
}

void BitSet::xorOperator (const BitSet& bs) {
    assert(size() == bs.size());
    std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_xor<bool>());        
}
   
void BitSet::setBits(int fromIndex, int toIndex, bool value) {
    assert(fromIndex <= toIndex);
    assert(fromIndex >=0);
    assert(toIndex <= size());
    std::vector<char>::iterator first = bitset_.begin() + fromIndex;
    std::vector<char>::iterator last = bitset_.begin() + toIndex;
    std::fill(first, last, value);
}

void BitSet::resize(int nbits) {
    int oldSize = size();
    bitset_.resize(nbits);
    if (nbits > oldSize) {
        std::fill(bitset_.begin()+oldSize, bitset_.begin()+nbits+1, false);
    }
}

BitSet operator| (const BitSet& bs1, const BitSet& bs2) {
    assert(bs1.size() == bs2.size());

    BitSet result(bs1);
    result |= bs2;
    return result;
}

BitSet operator& (const BitSet& bs1, const BitSet& bs2) {
    assert(bs1.size() == bs2.size());

    BitSet result(bs1);
    result &= bs2;
    return result;
}

BitSet operator^ (const BitSet& bs1, const BitSet& bs2) {
    assert(bs1.size() == bs2.size());

    BitSet result(bs1);
    result ^= bs2;
    return result;
}

BitSet operator- (const BitSet& bs1, const BitSet& bs2) {
    assert(bs1.size() == bs2.size());

    BitSet result(bs1);
    result -= bs2;
    return result;
}

bool operator== (const BitSet & bs1, const BitSet &bs2) {
    assert(bs1.size() == bs2.size());
    return std::equal(bs1.bitset_.begin(), bs1.bitset_.end(), bs2.bitset_.begin());
}

//std::istream& operator>> ( std::istream& is, const BitSet& bs) {
//
//    return is;
//}

std::ostream& operator<< ( std::ostream& os, const BitSet& bs) {
    for (int i = 0; i < bs.bitset_.size(); ++i) {
        std::string val = bs[i] ? "true" : "false";
        os << "BitSet[" << i <<"] = " << val << std::endl; 
    }
    
    return os;
}

}
Revision:	385
Committed:	Tue Mar 1 20:10:14 2005 UTC (20 years, 2 months ago) by tim
File size:	6477 byte(s)
Log Message:	fix compilation problem for g++ 3.4
#	User	Rev	Content
1	tim	277	/*
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			#include <algorithm>
43	tim	278	#include <cassert>
44	tim	296	#include <string>
45	tim	324
46			#include "utils/BitSet.hpp"
47			#include "utils/Algorithm.hpp"
48
49	tim	277	namespace oopse {
50			int BitSet::countBits() {
51	tim	347	#ifdef __RWSTD
52			//For the compiler(Sun, MSVC6.0) binding with RougeWave STL Library, we need to use old-style
53			// std::count which is error-prone.
54			int count = 0;
55			std::count(bitset_.begin(), bitset_.end(), true, count);
56			return count;
57			#else
58	tim	278	return std::count(bitset_.begin(), bitset_.end(), true);
59	tim	347	#endif
60	tim	277	}
61
62			void BitSet::flip(int fromIndex, int toIndex) {
63			assert(fromIndex <= toIndex);
64			assert(fromIndex >=0);
65			assert(toIndex <= size());
66			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
67			std::vector<char>::iterator last = bitset_.begin() + toIndex;
68
69			std::transform(first, last, first, std::logical_not<bool>());
70
71			}
72
73			BitSet BitSet::get(int fromIndex, int toIndex) {
74			assert(fromIndex <= toIndex);
75			assert(fromIndex >=0);
76			assert(toIndex <= size());
77			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
78			std::vector<char>::iterator last = bitset_.begin() + toIndex;
79
80			BitSet result;
81			std::copy(first, last, std::back_inserter(result.bitset_));
82			return result;
83			}
84
85	tim	278	bool BitSet::none() {
86	tim	277	std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
87			return i == bitset_.end() ? true : false;
88			}
89
90	tim	296	int BitSet::nextOffBit(int fromIndex) const {
91	tim	353	if (fromIndex <= -1) {
92			//in case -1 or other negative number is passed to this function
93			return -1;
94			}
95
96	tim	278	++fromIndex;
97			while (fromIndex < size()) {
98			if (!bitset_[fromIndex]) {
99			return fromIndex;
100			}
101			++fromIndex;
102			}
103	tim	277
104	tim	278	return -1;
105	tim	277	}
106
107	tim	296	int BitSet::nextOnBit(int fromIndex) const {
108	tim	353	if (fromIndex <= -1) {
109			//in case -1 or other negative number is passed to this function
110			return -1;
111			}
112
113	tim	278	++fromIndex;
114			while (fromIndex < size()) {
115			if (bitset_[fromIndex]) {
116			return fromIndex;
117			}
118			++fromIndex;
119			}
120	tim	277
121	tim	278	return -1;
122			}
123
124			void BitSet::andOperator (const BitSet& bs) {
125	tim	277	assert(size() == bs.size());
126
127			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_and<bool>());
128			}
129
130	tim	278	void BitSet::orOperator (const BitSet& bs) {
131	tim	277	assert(size() == bs.size());
132			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_or<bool>());
133			}
134
135	tim	278	void BitSet::xorOperator (const BitSet& bs) {
136	tim	277	assert(size() == bs.size());
137			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_xor<bool>());
138			}
139
140			void BitSet::setBits(int fromIndex, int toIndex, bool value) {
141			assert(fromIndex <= toIndex);
142			assert(fromIndex >=0);
143			assert(toIndex <= size());
144			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
145			std::vector<char>::iterator last = bitset_.begin() + toIndex;
146			std::fill(first, last, value);
147			}
148
149	tim	286	void BitSet::resize(int nbits) {
150			int oldSize = size();
151			bitset_.resize(nbits);
152			if (nbits > oldSize) {
153			std::fill(bitset_.begin()+oldSize, bitset_.begin()+nbits+1, false);
154			}
155			}
156
157	tim	278	BitSet operator\| (const BitSet& bs1, const BitSet& bs2) {
158	tim	277	assert(bs1.size() == bs2.size());
159
160			BitSet result(bs1);
161			result \|= bs2;
162			return result;
163			}
164
165	tim	278	BitSet operator& (const BitSet& bs1, const BitSet& bs2) {
166	tim	277	assert(bs1.size() == bs2.size());
167
168			BitSet result(bs1);
169			result &= bs2;
170			return result;
171			}
172
173	tim	278	BitSet operator^ (const BitSet& bs1, const BitSet& bs2) {
174	tim	277	assert(bs1.size() == bs2.size());
175
176			BitSet result(bs1);
177			result ^= bs2;
178			return result;
179			}
180
181	tim	353	BitSet operator- (const BitSet& bs1, const BitSet& bs2) {
182			assert(bs1.size() == bs2.size());
183
184			BitSet result(bs1);
185			result -= bs2;
186			return result;
187			}
188
189	tim	277	bool operator== (const BitSet & bs1, const BitSet &bs2) {
190			assert(bs1.size() == bs2.size());
191			return std::equal(bs1.bitset_.begin(), bs1.bitset_.end(), bs2.bitset_.begin());
192			}
193
194	tim	385	//std::istream& operator>> ( std::istream& is, const BitSet& bs) {
195			//
196			// return is;
197			//}
198	tim	277
199			std::ostream& operator<< ( std::ostream& os, const BitSet& bs) {
200	tim	296	for (int i = 0; i < bs.bitset_.size(); ++i) {
201			std::string val = bs[i] ? "true" : "false";
202			os << "BitSet[" << i <<"] = " << val << std::endl;
203			}
204
205	tim	278	return os;
206	tim	277	}
207
208			}