bitsets

I would like to know what is the memory usage of BitSet in Scala.For example, if I do: var bitArray:BitSet=new BitSet(10) bitArray.add(0) bitArray.add(2) bitArray.add(4) bitArray.add(6) bitArray.add(8) How does that compare with and array containing the even numbers 0,2,4,6,8? What about writing a number in binary: var bitArray:BitSet=new BitSet(32) bitArray.add(5) bitArray.add(3) bitArray.add(2) bitArray.add(1) bitArray.add(0) How does that compare to the number 47? I'm asking here of memory usage. But as a more open question, if you know, what are the advantages/disadvantages or uses of

Dynamic bitset I have a use case where i need to populate boost::dynamic_bitset<unsigned char> , from a std::string buffer. Can you suggest as to how to go about this. So I need to come up with a function void populateBitSet (std::string &buffer, boost::dynamic_bitset<unsigned char> & bitMap) { //populate bitMap from a string buffer } If you have binary data like this: string buffer = "0101001111011"; You want to initialize it like this (turns out there's a constructor that handles this case): void populateBitSet (std::string &buffer, boost::dynamic_bitset<unsigned char> & bitMap) { bitMap =

Consider the following code template<unsigned int N> void foo(std::bitset<N> bs) { /* whatever */ } int main() { bitset<8> bar; foo(bar); return 0; } g++ complains about this on 64 bit because the <8> gets interpreted as an unsigned long int, which doesn't exactly match the template. If I change the template to say unsigned long int, then 32-bit compiles complain. Obviously one way to fix this is to change bitset<8> to bitset<8ul>, but is there any way to re-write the template part so that it will work with whatever the default interpretation of a numeric literal is? The problem isn't whether