Integer Sets

Example

#include <LEDA/core/int_set.h>

int main()
{
  leda::int_set IS(1,1000);
		
  int i;
  for (i=1; i<=100; i++) IS.insert(2*i);
  
  if (IS.member(37)) std::cout << "37 is stored in S\n";
  else std::cout << "37 is not an element of S\n";
  
  if (IS.member(168)) std::cout << "168 is stored in S\n";
  else std::cout << "168 is not an element of S\n";
  
  return 0;
}

Strengths

• insert(), delete(), member(), empty(), size() need only constant time
• intersection, union, and complement need time proportional to the size of the interval.
• all operations are very fast (data type uses parallelism at word level)
• data type is very space efficient

Disadvantages

• restricted to ints from a fixed interval. Alternatives: Sets, Dynamic Integer Sets

Tips

• Use Integer Sets if you know in advance the interval of the ints you want to store. Otherwise consider using a Set or a Dynamic Integer Set.
• If you want to store objects other than int, consider using a Set , a Linear List or a One Dimensional Array.

See also:

Dynamic Integer Sets

Sets

Linear Lists

One Dimensional Arrays

Manual Page Integer Sets