FASTSET: A Fast Data Structure for the Representation of Sets of Integers

We describe a simple data structure for storing subsets of { 0 , … , N ？ 1 } , with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least one such operation. We report on the comparison of a Java implementation of our structure with other structures of the standard Java Collections. View Full-Tex