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>
namespace oopse {
int BitSet::countBits() {
    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::isEmpty() {
    std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
    return i == bitset_.end() ? true : false;
}
    
int BitSet::nextOffBit(int fromIndex) {

}

int BitSet::nextOnBit(int fromIndex); 

void BitSet::and(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::andNot(const BitSet& bs) {
    assert(size() == bs.size());
    std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_andNot<bool>());        
}

void BitSet::or(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::xor(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| (BitSet& bs1, BitSet& bs2) {
    assert(bs1.size() == bs2.size());

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

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

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

BitSet operator^ (BitSet& bs1, 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, BitSet& bs) {

}

std::ostream& operator<< ( std::ostream& os, const BitSet& bs) {

}

}
Revision:	277
Committed:	Tue Feb 1 06:55:00 2005 UTC (20 years, 3 months ago) by tim
File size:	5105 byte(s)
Log Message:	adding selection library
#	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			namespace oopse {
45			int BitSet::countBits() {
46			std::count(bitset_.begin(), bitset_.end(), true);
47			}
48
49			void BitSet::flip(int fromIndex, int toIndex) {
50			assert(fromIndex <= toIndex);
51			assert(fromIndex >=0);
52			assert(toIndex <= size());
53			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
54			std::vector<char>::iterator last = bitset_.begin() + toIndex;
55
56			std::transform(first, last, first, std::logical_not<bool>());
57
58			}
59
60			BitSet BitSet::get(int fromIndex, int toIndex) {
61			assert(fromIndex <= toIndex);
62			assert(fromIndex >=0);
63			assert(toIndex <= size());
64			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
65			std::vector<char>::iterator last = bitset_.begin() + toIndex;
66
67			BitSet result;
68			std::copy(first, last, std::back_inserter(result.bitset_));
69			return result;
70			}
71
72			bool BitSet::isEmpty() {
73			std::vector<char>::iterator i = std::find(bitset_.begin(), bitset_.end(), true);
74			return i == bitset_.end() ? true : false;
75			}
76
77			int BitSet::nextOffBit(int fromIndex) {
78
79			}
80
81			int BitSet::nextOnBit(int fromIndex);
82
83			void BitSet::and(const BitSet& bs) {
84			assert(size() == bs.size());
85
86			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_and<bool>());
87			}
88
89			void BitSet::andNot(const BitSet& bs) {
90			assert(size() == bs.size());
91			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_andNot<bool>());
92			}
93
94			void BitSet::or(const BitSet& bs){
95			assert(size() == bs.size());
96			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), std::logical_or<bool>());
97			}
98
99			void BitSet::xor(const BitSet& bs); {
100			assert(size() == bs.size());
101			std::transform(bs.bitset_.begin(), bs.bitset_.end(), bitset_.begin(), bitset_.begin(), oopse::logical_xor<bool>());
102			}
103
104			void BitSet::setBits(int fromIndex, int toIndex, bool value) {
105			assert(fromIndex <= toIndex);
106			assert(fromIndex >=0);
107			assert(toIndex <= size());
108			std::vector<char>::iterator first = bitset_.begin() + fromIndex;
109			std::vector<char>::iterator last = bitset_.begin() + toIndex;
110			std::fill(first, last, value);
111			}
112
113			BitSet operator\| (BitSet& bs1, BitSet& bs2) {
114			assert(bs1.size() == bs2.size());
115
116			BitSet result(bs1);
117			result \|= bs2;
118			return result;
119			}
120
121			BitSet operator& (BitSet& bs1, BitSet& bs2) {
122			assert(bs1.size() == bs2.size());
123
124			BitSet result(bs1);
125			result &= bs2;
126			return result;
127			}
128
129			BitSet operator^ (BitSet& bs1, BitSet& bs2) {
130			assert(bs1.size() == bs2.size());
131
132			BitSet result(bs1);
133			result ^= bs2;
134			return result;
135			}
136
137			bool operator== (const BitSet & bs1, const BitSet &bs2) {
138			assert(bs1.size() == bs2.size());
139			return std::equal(bs1.bitset_.begin(), bs1.bitset_.end(), bs2.bitset_.begin());
140			}
141
142			std::istream& operator>> ( std::istream& is, BitSet& bs) {
143
144			}
145
146			std::ostream& operator<< ( std::ostream& os, const BitSet& bs) {
147
148			}
149
150			}