Set::Infinite is a Set Theory module for infinite sets. A set is a collection of objects. The objects that belong to a set are called its members, or "elements". As objects we allow (almost) anything: reals, integers, and objects (such as dates). We ...

Set::Infinite::Basic is a Set Theory module for infinite sets. It works on reals, integers, and objects. This module does not support recurrences. Recurrences are implemented in Set::Infinite....

This is an internal class used by the DateTime::Set module. The API is subject to change. It provides all functionality provided by Set::Infinite, plus the ability to define recurrences with arbitrary objects, such as dates....

The Groups object implements a set of groups. Each group can own single members and group members. A group can be flattened, i.e. expansed until each of his members is a single one....

Creating $s = Set::Scalar->new; $s = Set::Scalar->new(@members); $t = $s->clone; $t = $s->copy; # Clone of clone. $t = $s->empty_clone; # Like clone() but with no members. Modifying $s->insert(@members); $s->delete(@members); $s->invert(@members); # ...

"Set::IntSpan" manages sets of integers. It is optimized for sets that have long runs of consecutive integers. These arise, for example, in .newsrc files, which maintain lists of articles: alt.foo: 1-21,28,31 alt.bar: 1-14192,14194,14196-14221 A run ...

DateTime::Set is a module for datetime sets. It can be used to handle two different types of sets. The first is a fixed set of predefined datetime objects. For example, if we wanted to create a set of datetimes containing the birthdays of people in o...

Essentially, this is a simple toolkit to map an infinite-many items to a corresponding finite-many values, i.e: A nick coloring algorithm. The most simple usage of this code gives out values from "items" sequentially, and remembers seen values and pe...

wat? Segment Tree <https://en.wikipedia.org/wiki/Segment_tree> A Segment tree is an immutable tree structure used to efficiently resolve a value to the set of segments which encompass it. Why? You have a large set of value intervals (like time segmen...

An instance of "Set::DynamicGroups" can manage a list of groups and the items (members) of those groups. It takes in various definitions of groups (rules about how to build the member list (see "GROUP SPECIFICATION")) and will return the list of item...

"Set::IntSpan::Fast" represents sets of integers. It is optimised for sets that contain contiguous runs of values. 1-1000, 2000-10000 # Efficiently handled Sets that don't have this characteristic may still be represented but some of the performance ...

This module extends the "Set::IntSpan" module by Steve McDougall. It implementing methods that are specific to islands, holes and covers. "Set::IntSpan::Island" inherits from Set::IntSpan. Terminology An integer set, as represented by "Set::IntSpan",...

This Perl extension provides methods which may be useful in manipulating sets whose elements are consecutive integers. Suppose that you are provided with the following non-intersecting, non-overlapping sets of consecutive integers: { 1 .. 17 } { 25 ....