NAME

Set::IntegerFast - Sets of Integers

Easy manipulation of sets of integers (intervals from zero to some positive integer)

SYNOPSIS

Please refer to Bit::Vector(3) for an overview and description of the methods supplied by this module!

DESCRIPTION

This module is kept "alive" for backward compatibility only; it is strongly recommended that you use the "Bit::Vector" module in your application(s) instead!

You will need to apply the following changes to your existing application(s):

"Set::IntegerFast"    -->    "Bit::Vector"         (required)

"Empty_Interval("     -->    "Interval_Empty("     (recommended)
"Fill_Interval("      -->    "Interval_Fill("      (recommended)
"Flip_Interval("      -->    "Interval_Flip("      (recommended)
"Delete("             -->    "Bit_On("             (recommended)
"Insert("             -->    "Bit_Off("            (recommended)
"flip("               -->    "bit_flip("           (recommended)
"in("                 -->    "bit_test("           (recommended)
"in("                 -->    "contains("           (alternative)
"inclusion("          -->    "subset("             (recommended)

Please refer to the file "CHANGES" in the "Bit::Vector" distribution for more details!

SEE ALSO

Bit::Vector(3), Set::IntegerRange(3), Math::MatrixBool(3), Math::MatrixReal(3), DFA::Kleene(3), Math::Kleene(3), Graph::Kruskal(3).

VERSION

This man page documents "Set::IntegerFast" version 4.1.

AUTHOR

Steffen Beyer <sb@sdm.de>.

COPYRIGHT

Copyright (c) 1995, 1996, 1997 by Steffen Beyer. All rights reserved.

LICENSE

This package is free software; you can redistribute it and/or modify it under the same terms as Perl itself.