Slightly increased the number of items in the pop tests
Only data structures, not algorithms...
Access unsafe statically
Implementation of a lock-free bitset
I'm having second thoughts on this assertion, after all lock cmpxchg should take care of atomicity for us. Anyway, removing for now.
Get rid of terribly named constants
Document size() too
Remind to increase the heap size or tests will fail because of not enough memory
Use an array of longs rather than an array of ints

There's indeed a small performance improvement, however it's not as big
as I would have thought. While reads and writes are not atomic on longs,
we can "ignore" the problem because the CAS includes a memory barrier on
the bit buckets (effectively transforming the read into a getLongVolatile).