src/utils/OOPSEBitSet.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/OOPSEBitSet.hpp"
#include "utils/Algorithm.hpp"

namespace oopse {
  int OOPSEBitSet::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 OOPSEBitSet::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>());
        
  }

  OOPSEBitSet OOPSEBitSet::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;

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

  bool OOPSEBitSet::none() {
    std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
    return i == bitset_.end() ? true : false;
  }
    
  int OOPSEBitSet::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 OOPSEBitSet::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 OOPSEBitSet::andOperator (const OOPSEBitSet& bs) {
    assert(size() == bs.size());

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

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

  void OOPSEBitSet::xorOperator (const OOPSEBitSet& bs) {
    assert(size() == bs.size());
    std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_xor<bool>());        
  }
   
  void OOPSEBitSet::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 OOPSEBitSet::resize(int nbits) {
    int oldSize = size();
    bitset_.resize(nbits);
    if (nbits > oldSize) {
      std::fill(bitset_.begin()+oldSize, bitset_.end(), false);
    }
  }

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

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

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

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

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

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

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

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

  bool operator== (const OOPSEBitSet & bs1, const OOPSEBitSet &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 OOPSEBitSet& bs) {
  //
  //    return is;
  //}

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

}
Revision:	2469
Committed:	Fri Dec 2 15:38:03 2005 UTC (19 years, 10 months ago) by tim
File size:	6685 byte(s)
Log Message:	End of the Link --> List Return of the Oject-Oriented replace yacc/lex parser with antlr parser
#	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/OOPSEBitSet.hpp"
47	#include "utils/Algorithm.hpp"
48
49	namespace oopse {
50	int OOPSEBitSet::countBits() {
51	#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	return std::count(bitset_.begin(), bitset_.end(), true);
59	#endif
60	}
61
62	void OOPSEBitSet::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	OOPSEBitSet OOPSEBitSet::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	OOPSEBitSet result;
81	std::copy(first, last, std::back_inserter(result.bitset_));
82	return result;
83	}
84
85	bool OOPSEBitSet::none() {
86	std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
87	return i == bitset_.end() ? true : false;
88	}
89
90	int OOPSEBitSet::nextOffBit(int fromIndex) const {
91	if (fromIndex <= -1) {
92	//in case -1 or other negative number is passed to this function
93	return -1;
94	}
95
96	++fromIndex;
97	while (fromIndex < size()) {
98	if (!bitset_[fromIndex]) {
99	return fromIndex;
100	}
101	++fromIndex;
102	}
103
104	return -1;
105	}
106
107	int OOPSEBitSet::nextOnBit(int fromIndex) const {
108	if (fromIndex <= -1) {
109	//in case -1 or other negative number is passed to this function
110	return -1;
111	}
112
113	++fromIndex;
114	while (fromIndex < size()) {
115	if (bitset_[fromIndex]) {
116	return fromIndex;
117	}
118	++fromIndex;
119	}
120
121	return -1;
122	}
123
124	void OOPSEBitSet::andOperator (const OOPSEBitSet& bs) {
125	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	void OOPSEBitSet::orOperator (const OOPSEBitSet& bs) {
131	assert(size() == bs.size());
132	std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_or<bool>());
133	}
134
135	void OOPSEBitSet::xorOperator (const OOPSEBitSet& bs) {
136	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 OOPSEBitSet::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	void OOPSEBitSet::resize(int nbits) {
150	int oldSize = size();
151	bitset_.resize(nbits);
152	if (nbits > oldSize) {
153	std::fill(bitset_.begin()+oldSize, bitset_.end(), false);
154	}
155	}
156
157	OOPSEBitSet operator\| (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2) {
158	assert(bs1.size() == bs2.size());
159
160	OOPSEBitSet result(bs1);
161	result \|= bs2;
162	return result;
163	}
164
165	OOPSEBitSet operator& (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2) {
166	assert(bs1.size() == bs2.size());
167
168	OOPSEBitSet result(bs1);
169	result &= bs2;
170	return result;
171	}
172
173	OOPSEBitSet operator^ (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2) {
174	assert(bs1.size() == bs2.size());
175
176	OOPSEBitSet result(bs1);
177	result ^= bs2;
178	return result;
179	}
180
181	OOPSEBitSet operator- (const OOPSEBitSet& bs1, const OOPSEBitSet& bs2) {
182	assert(bs1.size() == bs2.size());
183
184	OOPSEBitSet result(bs1);
185	result -= bs2;
186	return result;
187	}
188
189	bool operator== (const OOPSEBitSet & bs1, const OOPSEBitSet &bs2) {
190	assert(bs1.size() == bs2.size());
191	return std::equal(bs1.bitset_.begin(), bs1.bitset_.end(), bs2.bitset_.begin());
192	}
193
194	//std::istream& operator>> ( std::istream& is, const OOPSEBitSet& bs) {
195	//
196	// return is;
197	//}
198
199	std::ostream& operator<< ( std::ostream& os, const OOPSEBitSet& bs) {
200	for (int i = 0; i < bs.bitset_.size(); ++i) {
201	std::string val = bs[i] ? "true" : "false";
202	os << "OOPSEBitSet[" << i <<"] = " << val << std::endl;
203	}
204
205	return os;
206	}
207
208	}