Fast implementation of operations on large sets of quite big integers
问题 Description : I implemented the following class LabSetInt64 (see below code). The goal here is to manipulate large sets of big integers (up to values of 10M) as fast as possible. My main requirements are focused on : !Crucial : Getting the size/cardinality of a set as fast as possible !Important : Being able to iterate very fast through a set So, starting from the implementation below, it still remain two points I would like to discuss with you. The "popcount()" lazy implementation int