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 "utils/BitSet.hpp"
#include <algorithm>
#include <cassert>

namespace oopse {
int BitSet::countBits() {
    return std::count(bitset_.begin(), bitset_.end(), true);
}

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) {
    ++fromIndex;
    while (fromIndex < size()) {
        if (!bitset_[fromIndex]) {
            return fromIndex;
        }
        ++fromIndex;
    }

    return -1;
}

int BitSet::nextOnBit(int fromIndex) {
    ++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);
}

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) {
    return os;
}

}
Revision:	278
Committed:	Tue Feb 1 22:49:23 2005 UTC (20 years, 3 months ago) by tim
File size:	5350 byte(s)
Log Message:	Selection in progress
#	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 "utils/BitSet.hpp"
43			#include <algorithm>
44	tim	278	#include <cassert>
45
46	tim	277	namespace oopse {
47			int BitSet::countBits() {
48	tim	278	return std::count(bitset_.begin(), bitset_.end(), true);
49	tim	277	}
50
51			void BitSet::flip(int fromIndex, int toIndex) {
52			assert(fromIndex <= toIndex);
53			assert(fromIndex >=0);
54			assert(toIndex <= size());
55			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
56			std::vector<char>::iterator last = bitset_.begin() + toIndex;
57
58			std::transform(first, last, first, std::logical_not<bool>());
59
60			}
61
62			BitSet BitSet::get(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			BitSet result;
70			std::copy(first, last, std::back_inserter(result.bitset_));
71			return result;
72			}
73
74	tim	278	bool BitSet::none() {
75	tim	277	std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
76			return i == bitset_.end() ? true : false;
77			}
78
79			int BitSet::nextOffBit(int fromIndex) {
80	tim	278	++fromIndex;
81			while (fromIndex < size()) {
82			if (!bitset_[fromIndex]) {
83			return fromIndex;
84			}
85			++fromIndex;
86			}
87	tim	277
88	tim	278	return -1;
89	tim	277	}
90
91	tim	278	int BitSet::nextOnBit(int fromIndex) {
92			++fromIndex;
93			while (fromIndex < size()) {
94			if (bitset_[fromIndex]) {
95			return fromIndex;
96			}
97			++fromIndex;
98			}
99	tim	277
100	tim	278	return -1;
101			}
102
103			void BitSet::andOperator (const BitSet& bs) {
104	tim	277	assert(size() == bs.size());
105
106			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_and<bool>());
107			}
108
109	tim	278	void BitSet::orOperator (const BitSet& bs) {
110	tim	277	assert(size() == bs.size());
111			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_or<bool>());
112			}
113
114	tim	278	void BitSet::xorOperator (const BitSet& bs) {
115	tim	277	assert(size() == bs.size());
116			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_xor<bool>());
117			}
118
119			void BitSet::setBits(int fromIndex, int toIndex, bool value) {
120			assert(fromIndex <= toIndex);
121			assert(fromIndex >=0);
122			assert(toIndex <= size());
123			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
124			std::vector<char>::iterator last = bitset_.begin() + toIndex;
125			std::fill(first, last, value);
126			}
127
128	tim	278	BitSet operator\| (const BitSet& bs1, const BitSet& bs2) {
129	tim	277	assert(bs1.size() == bs2.size());
130
131			BitSet result(bs1);
132			result \|= bs2;
133			return result;
134			}
135
136	tim	278	BitSet operator& (const BitSet& bs1, const BitSet& bs2) {
137	tim	277	assert(bs1.size() == bs2.size());
138
139			BitSet result(bs1);
140			result &= bs2;
141			return result;
142			}
143
144	tim	278	BitSet operator^ (const BitSet& bs1, const BitSet& bs2) {
145	tim	277	assert(bs1.size() == bs2.size());
146
147			BitSet result(bs1);
148			result ^= bs2;
149			return result;
150			}
151
152			bool operator== (const BitSet & bs1, const BitSet &bs2) {
153			assert(bs1.size() == bs2.size());
154			return std::equal(bs1.bitset_.begin(), bs1.bitset_.end(), bs2.bitset_.begin());
155			}
156
157	tim	278	std::istream& operator>> ( std::istream& is, const BitSet& bs) {
158	tim	277
159	tim	278	return is;
160	tim	277	}
161
162			std::ostream& operator<< ( std::ostream& os, const BitSet& bs) {
163	tim	278	return os;
164	tim	277	}
165
166			}