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

    return -1;
}

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

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