Storing big numbers in BitSet for easy lookup

Asked Aug 15 '16 at 00:09

Active Aug 15 '16 at 00:09

Viewed 156 times

I want to parse files and read numbers which are stored as Strings and build the data structure to store the numbers.

Later in my application should provide method to check if a number is present in the list of numbers. These numbers will not fit into one long, but all the number can be represented with maximum of 512 bits.

I don't need to perform any maths operations on these number, but only search the presence of number.

Thought of storing the numbers in BitSet so that we can reduce the memory usage, but Maximum size of the BitSet is limited by MAX_SIZE of the Integer . Is there a better way to store the numbers for lookup?

asked Aug 15 '16 at 00:09

ravthiru

8,878
2
43
52

You don't need `BitSet` of size bigger than MAX_SIZE, you only need `new BitSet(512)` – waltersu Aug 15 '16 at 02:58
I need to store list of numbers, not just one number. – ravthiru Aug 15 '16 at 03:46
Is there a reason you can't use the [BigInteger](https://docs.oracle.com/javase/7/docs/api/java/math/BigInteger.html) class? – Jim Mischel Aug 15 '16 at 16:06
I need to just check presence of a number, so need not store all the numbers. – ravthiru Aug 17 '16 at 01:32

Storing big numbers in BitSet for easy lookup

0 Answers0