Manages sets of integers
# BEGIN { $Set::IntSpan::integer = 1 }
use Set::IntSpan qw(grep_set map_set grep_spans map_spans);
# $Set::IntSpan::Empty_String = '-'; # or '';
$set = new Set::IntSpan $set_spec;
$set = new Set::IntSpan @set_specs;
$valid = valid Set::IntSpan $run_list;
$set = copy $set $set_spec;
$run_list = run_list $set;
@elements = elements $set;
@sets = sets $set;
@spans = spans $set;
$u_set = union $set $set_spec;
$i_set = intersect $set $set_spec;
$x_set = xor $set $set_spec;
$d_set = diff $set $set_spec;
$c_set = complement $set;
$set->U($set_spec); # Union
$set->I($set_spec); # Intersect
$set->X($set_spec); # Xor
$set->D($set_spec); # Diff
$set->C; # Complement
equal $set $set_spec
equivalent $set $set_spec
superset $set $set_spec
subset $set $set_spec
$n = cardinality $set;
$n = size $set;
empty $set
finite $set
neg_inf $set
pos_inf $set
infinite $set
universal $set
member $set $n;
insert $set $n;
remove $set $n;
$min = min $set;
$max = max $set;
$holes = holes $set;
$cover = cover $set;
$inset = inset $set $n;
$smaller = trim $set $n;
$bigger = pad $set $n;
$subset = grep_set { ... } $set;
$mapset = map_set { ... } $set;
$subset = grep_spans { ... } $set;
$mapset = map_spans { ... } $set;
for ($element=$set->first; defined $element; $element=$set->next) { ... }
for ($element=$set->last ; defined $element; $element=$set->prev) { ... }
$element = $set->start($n);
$element = $set->current;
$n = $set->at($i);
$slice = $set->slice($from, $to);
$i = $set->ord($n);
$i = $set->span_ord($n);
$u_set = $set + $set_spec; # union $i_set = $set * $set_spec; # intersect $x_set = $set ^ $set_spec; # xor $d_set = $set - $set_spec; # diff $c_set = ~$set; # complement
$set += $set_spec; # union $set *= $set_spec; # intersect $set ^= $set_spec; # xor $set -= $set_spec; # diff
$set eq $set_spec # equal $set ne $set_spec # not equal $set le $set_spec # subset $set lt $set_spec # proper subset $set ge $set_spec # superset $set gt $set_spec # proper superset
# compare sets by cardinality $set1 == $set2 $set1 != $set2 $set1 <= $set2 $set1 < $set2 $set1 >= $set2 $set1 > $set2 $set1 <=> $set2
# compare cardinality of set to an integer $set1 == $n $set1 != $n $set1 <= $n $set1 < $n $set1 >= $n $set1 > $n $set1 <=> $n
@sorted = sort @sets; # sort sets by cardinality
if ($set) { ... } # true if $set is not empty
print "$set\n"; # stringizes to the run list
Nothing \*(C`grep_set\*(C', \*(C`map_set\*(C', \*(C`grep_spans\*(C', \*(C`map_spans\*(C'
\*(C`Set::IntSpan\*(C' 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 of consecutive integers is also called a span.
Sets are stored internally in a run-length coded form. This provides for both compact storage and efficient computation. In particular, set operations can be performed directly on the encoded representation.
\*(C`Set::IntSpan\*(C' is designed to manage finite sets. However, it can also represent some simple infinite sets, such as { x | x>n }. This allows operations involving complements to be carried out consistently, without having to worry about the actual value of \s-1INT_MAX\s0 on your machine.
A span is a run of consecutive integers. A span may be represented by an array reference, in any of 5 forms:
Span Set [ $n, $n ] { n } [ $a, $b ] { x | a<=x && x<=b}
Span Set [ undef, $b ] { x | x<=b } [ $a , undef ] { x | x>=a } [ undef, undef ] The set of all integers
Some methods operate directly on spans.
Many of the methods take a set specification. There are four kinds of set specifications.
If a set specification is omitted, then the empty set is assumed. Thus,
$set = new Set::IntSpan;
creates a new, empty set. Similarly,
copy $set;
removes all elements from $set.
If an object reference is given, it is taken to be a \*(C`Set::IntSpan\*(C' object.
If a string is given, it is taken to be a run list. A run list specifies a set using a syntax similar to that in newsrc files.
A run list is a comma-separated list of runs. Each run specifies a set of consecutive integers. The set is the union of all the runs.
Runs may be written in any of 5 forms.
Finite forms
{ n }
{ x | a<=x && x<=b }
Infinite forms
{ x | x<=n }
{ x | x>=n }
The set of all integers
Empty forms
The empty set is consistently written as '' (the null string). It is also denoted by the special form '-' (a single dash).
Restrictions
The runs in a run list must be disjoint, and must be listed in increasing order.
Valid characters in a run list are 0-9, '(', ')', '-' and ','. White space and underscore (_) are ignored. Other characters are not allowed.
Examples
Run list Set "-" { } "1" { 1 } "1-2" { 1, 2 } "-5--1" { -5, -4, -3, -2, -1 } "(-)" the integers "(--1" the negative integers "1-3, 4, 18-21" { 1, 2, 3, 4, 18, 19, 20, 21 }
If an array reference is given, then the elements of the array specify the elements of the set. The array may contain
integers
spans
The set is the union of all the integers and spans in the array. The integers and spans need not be disjoint. The integers and spans may be in any order.
Examples
Array ref Set [ ] { } [ 1, 1 ] { 1 } [ 1, 3, 2 ] { 1, 2, 3 } [ 1, [ 5, 8 ], 5, [ 7, 9 ], 2 ] { 1, 2, 5, 6, 7, 8, 9 } [ undef, undef ] the integers [ undef, -1 ] the negative integers
Each set has a single iterator, which is shared by all calls to \*(C`first\*(C', \*(C`last\*(C', \*(C`start\*(C', \*(C`next\*(C', \*(C`prev\*(C', and \*(C`current\*(C'. At all times, the iterator is either an element of the set, or \*(C`undef\*(C'.
\*(C`first\*(C', \*(C`last\*(C', and \*(C`start\*(C' set the iterator; \*(C`next\*(C', and \*(C`prev\*(C' move it; and \*(C`current\*(C' returns it. Calls to these methods may be freely intermixed.
Using \*(C`next\*(C' and \*(C`prev\*(C', a single loop can move both forwards and backwards through a set. Using \*(C`start\*(C', a loop can iterate over portions of an infinite set.
Creates and returns a \*(C`Set::IntSpan\*(C' object. The initial contents of the set are given by $set_spec, or by the union of all the @set_specs. Returns true if $run_list is a valid run list. Otherwise, returns false and leaves an error message in $@. Copies $set_spec into $set. The previous contents of $set are lost. For convenience, \*(C`copy\*(C' returns $set. Returns a run list that represents $set. The run list will not contain white space. $set is not affected. By default, the empty set is formatted as '-'; a different string may be specified in $Set::IntSpan::Empty_String. Returns an array containing the elements of $set. The elements will be sorted in numerical order. In scalar context, returns an array reference. $set is not affected. Returns the runs in $set, as a list of \*(C`Set::IntSpan\*(C' objects. The sets in the list are in order. Returns the runs in $set, as a list of the form ([$a1, $b1], [$a2, $b2], ... [$aN, $bN]) If a run contains only a single integer, then the upper and lower bounds of the corresponding span will be equal. If the set has no lower bound, then $a1 will be \*(C`undef\*(C'. Similarly, if the set has no upper bound, then $bN will be \*(C`undef\*(C'. The runs in the list are in order.
For these operations, a new \*(C`Set::IntSpan\*(C' object is created and returned. The operands are not affected. Returns the set of integers in either $set or $set_spec. Returns the set of integers in both $set and $set_spec. Returns the set of integers in $set or $set_spec, but not both. Returns the set of integers in $set but not in $set_spec. Returns the set of integers that are not in $set.
By popular demand, \*(C`Set::IntSpan\*(C' now has mutating forms of the binary set operations. These methods alter the object on which they are called. Makes $set the union of $set and $set_spec. Returns $set. Makes $set the intersection of $set and $set_spec. Returns $set. Makes $set the symmetric difference of $set and $set_spec. Returns $set. Makes $set the difference of $set and $set_spec. Returns $set. Converts $set to its own complement. Returns $set.
Returns true iff $set and $set_spec contain the same elements. Returns true iff $set and $set_spec contain the same number of elements. All infinite sets are equivalent. Returns true iff $set is a superset of $set_spec. Returns true iff $set is a subset of $set_spec.
Returns the number of elements in $set. Returns -1 for infinite sets. \*(C`size\*(C' is provided as an alias for \*(C`cardinality\*(C'. Returns true iff $set is empty. Returns true iff $set is finite. Returns true iff $set contains {x | x<n} for some n. Returns true iff $set contains {x | x>n} for some n. Returns true iff $set is infinite. Returns true iff $set contains all integers.
Returns true iff the integer $n is a member of $set. Inserts the integer $n into $set. Does nothing if $n is already a member of $set. Removes the integer $n from $set. Does nothing if $n is not a member of $set.
Returns the smallest element of $set, or \*(C`undef\*(C' if there is none. Returns the largest element of $set, or \*(C`undef\*(C' if there is none.
Returns a set containing all the holes in $set, that is, all the integers that are in-between spans of $set. \*(C`holes\*(C' is always a finite set. Returns a set consisting of a single span from $set->\*(C`min\*(C' to $set->\*(C`max\*(C'. This is the same as union $set $set->holes \*(C`inset\*(C' returns a set constructed by removing $n integers from each end of each span of $set. If $n is negative, then -$n integers are added to each end of each span. In the first case, spans may vanish from the set; in the second case, holes may vanish. \*(C`trim\*(C' is provided as a synonym for \*(C`inset\*(C'. \*(C`pad\*(C' $set $n is the same as \*(C`inset\*(C' $set -$n.
Sets the iterator for $set to the smallest element of $set. If there is no smallest element, sets the iterator to \*(C`undef\*(C'. Returns the iterator. Sets the iterator for $set to the largest element of $set. If there is no largest element, sets the iterator to \*(C`undef\*(C'. Returns the iterator. Sets the iterator for $set to $n. If $n is not an element of $set, sets the iterator to \*(C`undef\*(C'. Returns the iterator. Sets the iterator for $set to the next element of $set. If there is no next element, sets the iterator to \*(C`undef\*(C'. Returns the iterator. \*(C`next\*(C' will return \*(C`undef\*(C' only once; the next call to \*(C`next\*(C' will reset the iterator to the smallest element of $set. Sets the iterator for $set to the previous element of $set. If there is no previous element, sets the iterator to \*(C`undef\*(C'. Returns the iterator. \*(C`prev\*(C' will return \*(C`undef\*(C' only once; the next call to \*(C`prev\*(C' will reset the iterator to the largest element of $set. Returns the iterator for $set.
The elements of a set are kept in numerical order. These methods index into the set based on this ordering. Returns the $ith element of $set, or \*(C`undef\*(C' if there is no $ith element. Negative indices count backwards from the end of the set. Dies if
$i is non-negative and $set is \*(C`neg_inf\*(C'
$i is negative and $set is \*(C`pos_inf\*(C'
Returns a \*(C`Set::IntSpan\*(C' object containing the elements of $set at indices $from..$to. Negative indices count backwards from the end of the set. Dies if
$from is non-negative and $set is \*(C`neg_inf\*(C'
$from is negative and $set is \*(C`pos_inf\*(C'
The inverse of \*(C`at\*(C'. Returns the index $i of the integer $n in $set, or \*(C`undef\*(C' if $n if not an element of $set. Dies if $set is \*(C`neg_inf\*(C'. Returns the index $i of the span containing the integer $n, or \*(C`undef\*(C' if $n if not an element of $set. To recover the span containing $n, write ($set->spans)[$i]
For convenience, some operators are overloaded on \*(C`Set::IntSpan\*(C' objects.
One operand must be a \*(C`Set::IntSpan\*(C' object. The other operand may be a \*(C`Set::IntSpan\*(C' object or a set specification.
$u_set = $set + $set_spec; # union $i_set = $set * $set_spec; # intersect $x_set = $set ^ $set_spec; # xor $d_set = $set - $set_spec; # diff $c_set = ~$set; # complement
$set += $set_spec; # union $set *= $set_spec; # intersect $set ^= $set_spec; # xor $set -= $set_spec; # diff
The string comparison operations are overloaded to compare sets for equality and containment. One operand must be a \*(C`Set::IntSpan\*(C' object. The other operand may be a \*(C`Set::IntSpan\*(C' object or a set specification.
$set eq $set_spec # equal $set ne $set_spec # not equal $set le $set_spec # subset $set lt $set_spec # proper subset $set ge $set_spec # superset $set gt $set_spec # proper superset
The numerical comparison operations are overloaded to compare sets by cardinality. One operand must be a \*(C`Set::IntSpan\*(C' object. The other operand may be a \*(C`Set::IntSpan\*(C' object or an integer.
$set1 == $set2 $set1 != $set2 $set1 <= $set2 $set1 < $set2 $set1 >= $set2 $set1 > $set2 $set1 <=> $set2 $set1 cmp $set2
$set1 == $n $set1 != $n $set1 <= $n $set1 < $n $set1 >= $n $set1 > $n $set1 <=> $n $set1 cmp $n
N.B. The \*(C`cmp\*(C' operator is overloaded to compare sets by cardinality, not containment. This is done so that
sort @sets
will sort a list of sets by cardinality.
In boolean context, a \*(C`Set::IntSpan\*(C' object evaluates to true if it is not empty.
A \*(C`Set::IntSpan\*(C' object stringizes to its run list.
Evaluates the \s-1BLOCK\s0 for each integer in $set (locally setting $_ to each integer) and returns a \*(C`Set::IntSpan\*(C' object containing those integers for which the \s-1BLOCK\s0 returns \s-1TRUE\s0. Returns \*(C`undef\*(C' if $set is infinite. Evaluates the \s-1BLOCK\s0 for each integer in $set (locally setting $_ to each integer) and returns a \*(C`Set::IntSpan\*(C' object containing all the integers returned as results of all those evaluations. Evaluates the \s-1BLOCK\s0 in list context, so each element of $set may produce zero, one, or more elements in the returned set. The elements may be returned in any order, and need not be disjoint. Returns \*(C`undef\*(C' if $set is infinite. Evaluates the \s-1BLOCK\s0 for each span in $set and returns a \*(C`Set::IntSpan\*(C' object containing those spans for which the \s-1BLOCK\s0 returns \s-1TRUE\s0. Within \s-1BLOCK\s0, $_ is locally set to an array ref of the form [ $lower, $upper ] where $lower and $upper are the bounds of the span. If the span contains only one integer, then $lower and $upper will be equal. If the span is unbounded, then the corresponding element(s) of the array will be \*(C`undef\*(C'. Evaluates the \s-1BLOCK\s0 for each span in $set, and returns a \*(C`Set::IntSpan\*(C' object consisting of the union of all the spans returned as results of all those evaluations. Within \s-1BLOCK\s0, $_ is locally set to an array ref of the form [ $lower, $upper ] as described above for \*(C`grep_spans\*(C'. Each evaluation of \s-1BLOCK\s0 must return a list of spans. Each returned list may contain zero, one, or more spans. Spans may be returned in any order, and need not be disjoint. However, for each bounded span, the constraint $lower <= $upper must hold.
$Set::IntSpan::Empty_String contains the string that is returned when \*(C`run_list\*(C' is called on the empty set. $Empty_String is initially '-'; alternatively, it may be set to ''. Other values should be avoided, to ensure that \*(C`run_list\*(C' always returns a valid run list. \*(C`run_list\*(C' accesses $Empty_String through a reference stored in $set->{\*(C`empty_string\*(C'}. Subclasses that wish to override the value of $Empty_String can reassign this reference. Up until version 1.16, \*(C`Set::IntSpan\*(C' specified \*(C`use integer\*(C', because they were sets of...you know...integers. As of 2012, users are reporting newsgroups with article numbers above 0x7fffffff, which break \*(C`Set::IntSpan\*(C' on 32-bit processors. Version 1.17 removes \*(C`use integer\*(C' by default. This extends the usable range of \*(C`Set::IntSpan\*(C' to the number of bits in the mantissa of your floating point representation. For \s-1IEEE\s0 754 doubles, this is 53 bits, or around 9e15. I benchmarked \*(C`Set::IntSpan\*(C' on a Pentium 4, and it looks like \*(C`use integer\*(C' provides a 2% to 4% speedup, depending on the application. If you want \*(C`use integer\*(C' back, either for performance, or because you are somehow dependent on its semantics, write BEGIN { $Set::IntSpan::integer = 1 } use Set::IntSpan;
Any method (except \*(C`valid\*(C') will \*(C`die\*(C' if it is passed an invalid run list. (F) $run_list has bad syntax (F) $run_list has overlapping runs or runs that are out of order. (F) An infinite set was passed to \*(C`elements\*(C'. (F) \*(C`at\*(C' was called with a non-negative index on a negative infinite set. (F) \*(C`at\*(C' was called with a negative index on a positive infinite set. (F) \*(C`slice\*(C' was called with $from non-negative on a negative infinite set. (F) \*(C`slice\*(C' was called with $from negative on a positive infinite set. (F) \*(C`ord\*(C' was called on a negative infinite set.
(X) \*(C`elements\*(C' $set can generate an \*(L"Out of memory!\*(R" message on sufficiently large finite sets.
Beware of forms like
union $set [1..5];
This passes an element of @set to union, which is probably not what you want. To force interpretation of $set and [1..5] as separate arguments, use forms like
union $set +[1..5];
or
$set->union([1..5]);
\*(C`grep_set\*(C' and \*(C`map_set\*(C' make it easy to construct sets for which the internal representation used by \*(C`Set::IntSpan\*(C' is not small. Consider:
$billion = new Set::IntSpan '0-1_000_000_000'; # OK $odd = grep_set { $_ & 1 } $billion; # trouble $even = map_set { $_ * 2 } $billion; # double trouble
There are two common approaches to error handling: exceptions and return codes. There seems to be some religion on the topic, so \*(C`Set::IntSpan\*(C' provides support for both.
To catch exceptions, protect method calls with an eval:
$run_list = <STDIN>; eval { $set = new Set::IntSpan $run_list }; $@ and print "$@: try again\n";
To check return codes, use an appropriate method call to validate arguments:
$run_list = <STDIN>; if (valid Set::IntSpan $run_list) { $set = new Set::IntSpan $run_list } else { print "$@ try again\n" }
Similarly, use \*(C`finite\*(C' to protect calls to \*(C`elements\*(C':
finite $set and @elements = elements $set;
Calling \*(C`elements\*(C' on a large, finite set can generate an \*(L"Out of memory!\*(R" message, which cannot (easily) be trapped. Applications that must retain control after an error can use \*(C`intersect\*(C' to protect calls to \*(C`elements\*(C':
@elements = elements { intersect $set "-1_000_000 - 1_000_000" };
or check the size of $set first:
finite $set and cardinality $set < 2_000_000 and @elements = elements $set;
Although \*(C`Set::IntSpan\*(C' can represent some infinite sets, it does not perform infinite-precision arithmetic. Therefore, finite elements are restricted to the range of integers on your machine.
Users report that you can construct Set::IntSpan objects on anything that behaves like an integer. For example:
$x = new Math::BigInt ...; $set = new Set::Intspan [ [ $x, $x+5 ] ];
I'm not documenting this as supported behavior, because I don't have the resources to test it, but I'll try not to break it. If anyone finds problems with it, let me know.
The sets implemented here are based on a Macintosh data structure called a region. See Inside Macintosh for more information.
\*(C`Set::IntSpan\*(C' was originally written to manage run lists for the \*(C`News::Newsrc\*(C' module.
Steven McDougall <[email protected]>
Malcolm Cook <[email protected]>
David Hawthorne <[email protected]>
Martin Krzywinski <[email protected]>
Marc Lehmann <[email protected]>
Andrew Olson <[email protected]>
Nicholas Redgrave <[email protected]>
Copyright (c) 1996-2013 by Steven McDougall. This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself.