src/antlr/BitSet.hpp

#ifndef INC_BitSet_hpp__
#define INC_BitSet_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id$
 */

#include <antlr/config.hpp>
#include <vector>
#include <stdexcept>

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A BitSet to replace java.util.BitSet.
 * Primary differences are that most set operators return new sets
 * as opposed to oring and anding "in place".  Further, a number of
 * operations were added.  I cannot contain a BitSet because there
 * is no way to access the internal bits (which I need for speed)
 * and, because it is final, I cannot subclass to add functionality.
 * Consider defining set degree.  Without access to the bits, I must
 * call a method n times to test the ith bit...ack!
 *
 * Also seems like or() from util is wrong when size of incoming set is bigger
 * than this.length.
 *
 * This is a C++ version of the Java class described above, with only
 * a handful of the methods implemented, because we don't need the
 * others at runtime. It's really just a wrapper around vector<bool>,
 * which should probably be changed to a wrapper around bitset, once
 * bitset is more widely available.
 *
 * @author Terence Parr, MageLang Institute
 * @author <br><a href="mailto:pete@yamuna.demon.co.uk">Pete Wells</a>
 */
class ANTLR_API BitSet {
private:
        ANTLR_USE_NAMESPACE(std)vector<bool> storage;

public:
        BitSet( unsigned int nbits=64 );
        BitSet( const unsigned long* bits_, unsigned int nlongs);
        ~BitSet();

        void add( unsigned int el );

        bool member( unsigned int el ) const;

        ANTLR_USE_NAMESPACE(std)vector<unsigned int> toArray() const;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_BitSet_hpp__
Revision:	1465
Committed:	Fri Jul 9 23:08:25 2010 UTC (15 years, 3 months ago) by chuckv
File size:	1782 byte(s)
Log Message:	Creating busticated version of OpenMD
#	User	Rev	Content
1	tim	770	#ifndef INC_BitSet_hpp__
2			#define INC_BitSet_hpp__
3
4			/* ANTLR Translator Generator
5			* Project led by Terence Parr at http://www.jGuru.com
6			* Software rights: http://www.antlr.org/license.html
7			*
8	gezelter	1442	* $Id$
9	tim	770	*/
10
11			#include <antlr/config.hpp>
12			#include <vector>
13			#include <stdexcept>
14
15			#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
16			namespace antlr {
17			#endif
18
19			/** A BitSet to replace java.util.BitSet.
20			* Primary differences are that most set operators return new sets
21			* as opposed to oring and anding "in place". Further, a number of
22			* operations were added. I cannot contain a BitSet because there
23			* is no way to access the internal bits (which I need for speed)
24			* and, because it is final, I cannot subclass to add functionality.
25			* Consider defining set degree. Without access to the bits, I must
26			* call a method n times to test the ith bit...ack!
27			*
28			* Also seems like or() from util is wrong when size of incoming set is bigger
29			* than this.length.
30			*
31			* This is a C++ version of the Java class described above, with only
32			* a handful of the methods implemented, because we don't need the
33			* others at runtime. It's really just a wrapper around vector<bool>,
34			* which should probably be changed to a wrapper around bitset, once
35			* bitset is more widely available.
36			*
37			* @author Terence Parr, MageLang Institute
38			* @author <br><a href="mailto:pete@yamuna.demon.co.uk">Pete Wells</a>
39			*/
40			class ANTLR_API BitSet {
41			private:
42			ANTLR_USE_NAMESPACE(std)vector<bool> storage;
43
44			public:
45			BitSet( unsigned int nbits=64 );
46			BitSet( const unsigned long* bits_, unsigned int nlongs);
47			~BitSet();
48
49			void add( unsigned int el );
50
51			bool member( unsigned int el ) const;
52
53			ANTLR_USE_NAMESPACE(std)vector<unsigned int> toArray() const;
54			};
55
56			#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
57			}
58			#endif
59
60			#endif //INC_BitSet_hpp__