Use Roaring bitmap

[zietzm]

I am considering switching the HashTable custom implementation to a compressed bitset implemented in C, Roaring Bitmap. Since the bitset is often extremely sparse, this should offer a great time/memory tradeoff and should be able to work more flexibly for networks of greater size.

There have been a few example networks I wanted to permute where an uncompressed bit array simply took too much memory.