Chip 2000 May

home *** CD-ROM | disk | FTP | other *** search

/ Chip 2000 May / Chip_2000-05_cd1.bin / zkuste / Perl / ActivePerl-5.6.0.613.msi / 䆊䌷䈹䈙䏵-䞅䞆䞀㡆䞃䄦䠥 / _f3971d0fec61f8f09697afe333f1d81d < prev next >

Wrap

Text File | 2000-03-23 | 26KB | 661 lines

<HTML> <HEAD> <TITLE>Set::IntSpan - Manages sets of integers</TITLE> <LINK REL="stylesheet" HREF="../../../Active.css" TYPE="text/css"> <LINK REV="made" HREF="mailto:"> </HEAD> <BODY> <TABLE BORDER=0 CELLPADDING=0 CELLSPACING=0 WIDTH=100%> <TR><TD CLASS=block VALIGN=MIDDLE WIDTH=100% BGCOLOR="#cccccc"> Set::IntSpan - Manages sets of integers </TD></TR> </TABLE> <A NAME="__index__"></A>  <UL> <LI><A HREF="#name">NAME</A></LI><LI><A HREF="#supportedplatforms">SUPPORTED PLATFORMS</A></LI> <LI><A HREF="#synopsis">SYNOPSIS</A></LI> <LI><A HREF="#requires">REQUIRES</A></LI> <LI><A HREF="#exports">EXPORTS</A></LI> <UL> <LI><A HREF="#@export"><CODE>@EXPORT</CODE></A></LI> <LI><A HREF="#@export_ok"><CODE>@EXPORT_OK</CODE></A></LI> </UL> <LI><A HREF="#description">DESCRIPTION</A></LI> <LI><A HREF="#set specifications">SET SPECIFICATIONS</A></LI> <UL> <LI><A HREF="#empty">Empty</A></LI> <LI><A HREF="#object reference">Object reference</A></LI> <LI><A HREF="#array reference">Array reference</A></LI> <LI><A HREF="#run list">Run list</A></LI> <LI><A HREF="#finite forms">Finite forms</A></LI> <LI><A HREF="#infinite forms">Infinite forms</A></LI> <LI><A HREF="#empty forms">Empty forms</A></LI> <LI><A HREF="#restrictions">Restrictions</A></LI> <LI><A HREF="#examples">Examples</A></LI> </UL> <LI><A HREF="#iterators">ITERATORS</A></LI> <LI><A HREF="#methods">METHODS</A></LI> <UL> <LI><A HREF="#creation">Creation</A></LI> <LI><A HREF="#set operations">Set operations</A></LI> <LI><A HREF="#comparison">Comparison</A></LI> <LI><A HREF="#cardinality">Cardinality</A></LI> <LI><A HREF="#membership">Membership</A></LI> <LI><A HREF="#extrema">Extrema</A></LI> <LI><A HREF="#iterators">Iterators</A></LI> </UL> <LI><A HREF="#functions">FUNCTIONS</A></LI> <LI><A HREF="#class variables">CLASS VARIABLES</A></LI> <LI><A HREF="#diagnostics">DIAGNOSTICS</A></LI> <LI><A HREF="#notes">NOTES</A></LI> <UL> <LI><A HREF="#traps">Traps</A></LI> <LI><A HREF="#cardinality">Cardinality</A></LI> <LI><A HREF="#grep_set and map_set">grep_set and map_set</A></LI> <LI><A HREF="#error handling">Error handling</A></LI> <LI><A HREF="#limitations">Limitations</A></LI> <LI><A HREF="#roots">Roots</A></LI> </UL> <LI><A HREF="#author">AUTHOR</A></LI> <LI><A HREF="#copyright">COPYRIGHT</A></LI> </UL>  <HR> <H1><A NAME="name">NAME</A></H1> Set::IntSpan - Manages sets of integers <HR> <H1><A NAME="supportedplatforms">SUPPORTED PLATFORMS</A></H1> <UL> <LI>Linux</LI> <LI>Solaris</LI> <LI>Windows</LI> </UL> <HR> <H1><A NAME="synopsis">SYNOPSIS</A></H1> <PRE> use Set::IntSpan qw(grep_set map_set); </PRE> <PRE> $Set::IntSpan::Empty_String = $string;</PRE> <PRE> $set = new Set::IntSpan $set_spec; $valid = valid Set::IntSpan $run_list; $set = copy $set $set_spec;</PRE> <PRE> $run_list = run_list $set; @elements = elements $set;</PRE> <PRE> $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;</PRE> <PRE> equal $set $set_spec; equivalent $set $set_spec; superset $set $set_spec; subset $set $set_spec;</PRE> <PRE> $n = cardinality $set;</PRE> <PRE> empty $set; finite $set; neg_inf $set; pos_inf $set; infinite $set; universal $set;</PRE> <PRE> member $set $n; insert $set $n; remove $set $n;</PRE> <PRE> $min = min $set; $max = max $set;</PRE> <PRE> $subset = grep_set { ... } $set; $mapset = map_set { ... } $set;</PRE> <PRE> for ($element=$set->first; defined $element; $element=$set->next) { ... } for ($element=$set->last ; defined $element; $element=$set->prev) { ... }</PRE> <PRE> $element = $set->start($n); $element = $set->current;</PRE> <HR> <H1><A NAME="requires">REQUIRES</A></H1> Perl 5.004, Exporter <HR> <H1><A NAME="exports">EXPORTS</A></H1> <H2><A NAME="@export"><CODE>@EXPORT</CODE></A></H2> Nothing <H2><A NAME="@export_ok"><CODE>@EXPORT_OK</CODE></A></H2> <CODE>grep_set</CODE>, <CODE>map_set</CODE> <HR> <H1><A NAME="description">DESCRIPTION</A></H1> <CODE>Set::IntSpan</CODE> 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: <PRE> alt.foo: 1-21,28,31 alt.bar: 1-14192,14194,14196-14221</PRE> 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. <CODE>Set::IntSpan</CODE> 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 INT_MAX on your machine. <HR> <H1><A NAME="set specifications">SET SPECIFICATIONS</A></H1> Many of the methods take a set specification. There are four kinds of set specifications. <H2><A NAME="empty">Empty</A></H2> If a set specification is omitted, then the empty set is assumed. Thus, <PRE> $set = new Set::IntSpan;</PRE> creates a new, empty set. Similarly, <PRE> copy $set;</PRE> removes all elements from $set. <H2><A NAME="object reference">Object reference</A></H2> If an object reference is given, it is taken to be a <CODE>Set::IntSpan</CODE> object. <H2><A NAME="array reference">Array reference</A></H2> If an array reference is given, then the elements of the array are taken to be the elements of the set. The array may contain duplicate elements. The elements of the array may be in any order. <H2><A NAME="run list">Run list</A></H2> 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 several forms. <H2><A NAME="finite forms">Finite forms</A></H2> <DL> <DT><A NAME="item_n">n</A> <DD> { n } <DT><A NAME="item_a%2Db">a-b</A> <DD> {x | a<=x && x<=b} </DL> <H2><A NAME="infinite forms">Infinite forms</A></H2> <DL> <DT><A NAME="item_%28%2Dn">(-n</A> <DD> {x | x<=n} <DT><A NAME="item_n%2D%29">n-)</A> <DD> {x | x>=n} <DT><A NAME="item_%28%2D%29">(-)</A> <DD> The set of all integers </DL> <H2><A NAME="empty forms">Empty forms</A></H2> The empty set is consistently written as '' (the null string). It is also denoted by the special form '-' (a single dash). <H2><A NAME="restrictions">Restrictions</A></H2> 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. <H2><A NAME="examples">Examples</A></H2> <DL> <DT><A NAME="item__%2D"> -</A> <DD> { } <DT><A NAME="item__1"> 1</A> <DD> { 1 } <DT><A NAME="item__1%2D2"> 1-2</A> <DD> { 1, 2 } <DT><A NAME="item__%2D5%2D%2D1"> -5--1</A> <DD> { -5, -4, -3, -2, -1 } <DT><A NAME="item__%28%2D%29"> (-)</A> <DD> the integers <DT><A NAME="item__%28%2D%2D1"> (--1</A> <DD> the negative integers <DT><A NAME="item__1%2D3%2C_4%2C_18%2D21"> 1-3, 4, 18-21</A> <DD> { 1, 2, 3, 4, 18, 19, 20, 21 } </DL> <HR> <H1><A NAME="iterators">ITERATORS</A></H1> Each set has a single iterator, which is shared by all calls to <A HREF="#item_first"><CODE>first</CODE></A>, <A HREF="#item_last"><CODE>last</CODE></A>, <A HREF="#item_start"><CODE>start</CODE></A>, <A HREF="#item_next"><CODE>next</CODE></A>, <A HREF="#item_prev"><CODE>prev</CODE></A>, and <A HREF="#item_current"><CODE>current</CODE></A>. At all times, the iterator is either an element of the set, or <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A>. <A HREF="#item_first"><CODE>first</CODE></A>, <A HREF="#item_last"><CODE>last</CODE></A>, and <A HREF="#item_start"><CODE>start</CODE></A> set the iterator; <A HREF="#item_next"><CODE>next</CODE></A>, and <A HREF="#item_prev"><CODE>prev</CODE></A> move it; and <A HREF="#item_current"><CODE>current</CODE></A> returns it. Calls to these methods may be freely intermixed. Using <A HREF="#item_next"><CODE>next</CODE></A> and <A HREF="#item_prev"><CODE>prev</CODE></A>, a single loop can move both forwards and backwards through a set. Using <A HREF="#item_start"><CODE>start</CODE></A>, a loop can iterate over portions of an infinite set. <HR> <H1><A NAME="methods">METHODS</A></H1> <H2><A NAME="creation">Creation</A></H2> <DL> <DT><A NAME="item_%24set_%3D_new_Set%3A%3AIntSpan_%24set_spec">$set = <CODE>new</CODE> <CODE>Set::IntSpan</CODE> $set_spec</A> <DD> Creates and returns a <CODE>Set::IntSpan</CODE> object. The initial contents of the set are given by $set_spec. <DT><A NAME="item_%24ok_%3D_valid_Set%3A%3AIntSpan_%24run_list">$ok = <CODE>valid</CODE> <CODE>Set::IntSpan</CODE> $run_list</A> <DD> Returns true if $run_list is a valid run list. Otherwise, returns false and leaves an error message in $@. <DT><A NAME="item_%24set_%3D_copy_%24set_%24set_spec">$set = <CODE>copy</CODE> $set $set_spec</A> <DD> Copies $set_spec into $set. The previous contents of $set are lost. For convenience, <CODE>copy</CODE> returns $set. <DT><A NAME="item_%24run_list_%3D_run_list_%24set">$run_list = <CODE>run_list</CODE> $set</A> <DD> 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 <A HREF="#item_%24Set%3A%3AIntSpan%3A%3AEmpty_String"><CODE>$Set::IntSpan::Empty_String</CODE></A>. <DT><A NAME="item_%40elements_%3D_elements_%24set">@elements = <CODE>elements</CODE> $set</A> <DD> 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. </DL> <H2><A NAME="set operations">Set operations</A></H2> <DL> <DT><A NAME="item_%24u_set_%3D_union_%24set_%24set_spec">$u_set = <CODE>union</CODE> $set $set_spec</A> <DD> Returns the set of integers in either $set or $set_spec. <DT><A NAME="item_%24i_set_%3D_intersect_%24set_%24set_spec">$i_set = <CODE>intersect</CODE> $set $set_spec</A> <DD> Returns the set of integers in both $set and $set_spec. <DT><A NAME="item_%24x_set_%3D_xor_%24set_%24set_spec">$x_set = <CODE>xor</CODE> $set $set_spec</A> <DD> Returns the set of integers in $set or $set_spec, but not both. <DT><A NAME="item_%24d_set_%3D_diff_%24set_%24set_spec">$d_set = <CODE>diff</CODE> $set $set_spec</A> <DD> Returns the set of integers in $set but not in $set_spec. <DT><A NAME="item_%24c_set_%3D_complement_%24set">$c_set = <CODE>complement</CODE> $set</A> <DD> Returns the set of integers that are not in $set. </DL> For all set operations, a new <CODE>Set::IntSpan</CODE> object is created and returned. The operands are not affected. <H2><A NAME="comparison">Comparison</A></H2> <DL> <DT><A NAME="item_equal_%24set_%24set_spec"><CODE>equal</CODE> $set $set_spec</A> <DD> Returns true iff $set and $set_spec contain the same elements. <DT><A NAME="item_equivalent_%24set_%24set_spec"><CODE>equivalent</CODE> $set $set_spec</A> <DD> Returns true iff $set and $set_spec contain the same number of elements. All infinite sets are equivalent. <DT><A NAME="item_superset_%24set_%24set_spec"><CODE>superset</CODE> $set $set_spec</A> <DD> Returns true iff $set is a superset of $set_spec. <DT><A NAME="item_subset_%24set_%24set_spec"><CODE>subset</CODE> $set $set_spec</A> <DD> Returns true iff $set is a subset of $set_spec. </DL> <H2><A NAME="cardinality">Cardinality</A></H2> <DL> <DT><A NAME="item_%24n_%3D_cardinality_%24set">$n = <CODE>cardinality</CODE> $set</A> <DD> Returns the number of elements in $set. Returns -1 for infinite sets. <DT><A NAME="item_empty_%24set"><CODE>empty</CODE> $set</A> <DD> Returns true iff $set is empty. <DT><A NAME="item_finite_%24set"><CODE>finite</CODE> $set</A> <DD> Returns true iff $set is finite. <DT><A NAME="item_neg_inf_%24set"><CODE>neg_inf</CODE> $set</A> <DD> Returns true iff $set contains {x | x<n} for some n. <DT><A NAME="item_pos_inf_%24set"><CODE>pos_inf</CODE> $set</A> <DD> Returns true iff $set contains {x | x>n} for some n. <DT><A NAME="item_infinite_%24set"><CODE>infinite</CODE> $set</A> <DD> Returns true iff $set is infinite. <DT><A NAME="item_universal_%24set">universal $set</A> <DD> Returns true iff $set contains all integers. </DL> <H2><A NAME="membership">Membership</A></H2> <DL> <DT><A NAME="item_member_%24set_%24n"><CODE>member</CODE> $set $n</A> <DD> Returns true iff the integer $n is a member of $set. <DT><A NAME="item_insert_%24set_%24n"><CODE>insert</CODE> $set $n</A> <DD> Inserts the integer $n into $set. Does nothing if $n is already a member of $set. <DT><A NAME="item_remove_%24set_%24n"><CODE>remove</CODE> $set $n</A> <DD> Removes the integer $n from $set. Does nothing if $n is not a member of $set. </DL> <H2><A NAME="extrema">Extrema</A></H2> <DL> <DT><A NAME="item_min_%24set"><CODE>min</CODE> $set</A> <DD> Returns the smallest element of $set, or <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A> if there is none. <DT><A NAME="item_max_%24set"><CODE>max</CODE> $set</A> <DD> Returns the largest element of $set, or <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A> if there is none. </DL> <H2><A NAME="iterators">Iterators</A></H2> <DL> <DT><A NAME="item_first">$set-><CODE>first</CODE></A> <DD> Sets the iterator for $set to the smallest element of $set. If there is no smallest element, sets the iterator to <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A>. Returns the iterator. <DT><A NAME="item_last">$set-><CODE>last</CODE></A> <DD> Sets the iterator for $set to the largest element of $set. If there is no largest element, sets the iterator to <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A>. Returns the iterator. <DT><A NAME="item_start">$set-><CODE>start</CODE>($n)</A> <DD> Sets the iterator for $set to $n. If $n is not an element of $set, sets the iterator to <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A>. Returns the iterator. <DT><A NAME="item_next">$set-><CODE>next</CODE></A> <DD> Sets the iterator for $set to the next element of $set. If there is no next element, sets the iterator to <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A>. Returns the iterator. <A HREF="#item_next"><CODE>next</CODE></A> will return <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A> only once; the next call to <A HREF="#item_next"><CODE>next</CODE></A> will reset the iterator to the smallest element of $set. <DT><A NAME="item_prev">$set-><CODE>prev</CODE></A> <DD> Sets the iterator for $set to the previous element of $set. If there is no previous element, sets the iterator to <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A>. Returns the iterator. <A HREF="#item_prev"><CODE>prev</CODE></A> will return <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A> only once; the next call to <A HREF="#item_prev"><CODE>prev</CODE></A> will reset the iterator to the largest element of $set. <DT><A NAME="item_current">$set-><CODE>current</CODE></A> <DD> Returns the iterator for $set. </DL> <HR> <H1><A NAME="functions">FUNCTIONS</A></H1> <DL> <DT><A NAME="item_%24sub_set_%3D_grep_set_%7B_%2E%2E%2E_%7D_%24set">$sub_set = <CODE>grep_set</CODE> { ... } $set</A> <DD> Evaluates the BLOCK for each integer in $set (locally setting <CODE>$_</CODE> to each integer) and returns a <CODE>Set::IntSpan</CODE> object containing those integers for which the BLOCK returns TRUE. Returns <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A> if $set is infinite. <DT><A NAME="item_%24map_set_%3D_map_set_%7B_%2E%2E%2E_%7D_%24set">$map_set = <CODE>map_set</CODE> { ... } $set</A> <DD> Evaluates the BLOCK for each integer in $set (locally setting <CODE>$_</CODE> to each integer) and returns a <CODE>Set::IntSpan</CODE> object containg all the integers returned as results of all those evaluations. Evaluates the BLOCK in list context, so each element of $set may produce zero, one, or more elements in the returned set. Returns <A HREF="../../../lib/Pod/perlfunc.html#item_undef"><CODE>undef</CODE></A> if $set is infinite. </DL> <HR> <H1><A NAME="class variables">CLASS VARIABLES</A></H1> <DL> <DT><A NAME="item_%24Set%3A%3AIntSpan%3A%3AEmpty_String"><CODE>$Set::IntSpan::Empty_String</CODE></A> <DD> <A HREF="#item_%24Set%3A%3AIntSpan%3A%3AEmpty_String"><CODE>$Set::IntSpan::Empty_String</CODE></A> contains the string that is returned when <CODE>run_list</CODE> is called on the empty set. <CODE>$Empty_String</CODE> is initially '-'; alternatively, it may be set to ''. Other values should be avoided, to ensure that <CODE>run_list</CODE> always returns a valid run list. <CODE>run_list</CODE> accesses <CODE>$Empty_String</CODE> through a reference stored in $set->{<CODE>empty_string</CODE>}. Subclasses that wish to override the value of <CODE>$Empty_String</CODE> can reassign this reference. </DL> <HR> <H1><A NAME="diagnostics">DIAGNOSTICS</A></H1> Any method (except <CODE>valid</CODE>) will <A HREF="../../../lib/Pod/perlfunc.html#item_die"><CODE>die</CODE></A> if it is passed an invalid run list. <DL> <DT><A NAME="item_Set%3A%3AIntSpan%3A%3A_copy_run_list%3A_Bad_syntax"><CODE>Set::IntSpan::_copy_run_list: Bad syntax:</CODE> $runList</A> <DD> (F) $run_list has bad syntax <DT><A NAME="item_Set%3A%3AIntSpan%3A%3A_copy_run_list%3A_Bad_order%"><CODE>Set::IntSpan::_copy_run_list: Bad order:</CODE> $runList</A> <DD> (F) $run_list has overlapping runs or runs that are out of order. <DT><A NAME="item_Set%3A%3AIntSpan%3A%3Aelements%3A_infinite_set"><CODE>Set::IntSpan::elements: infinite set</CODE></A> <DD> (F) An infinte set was passed to <CODE>elements</CODE>. <DT><A NAME="item_Out_of_memory%21">Out of memory!</A> <DD> (X) <CODE>elements</CODE> $set can generate an ``Out of memory!'' message on sufficiently large finite sets. </DL> <HR> <H1><A NAME="notes">NOTES</A></H1> <H2><A NAME="traps">Traps</A></H2> Beware of forms like <PRE> union $set [1..5];</PRE> 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 <PRE> union $set +[1..5];</PRE> or <PRE> $set->union([1..5]);</PRE> <H2><A NAME="cardinality">Cardinality</A></H2> You cannot use the obvious comparison routine <PRE> { $a->cardinality <=> $b->cardinality }</PRE> to sort sets by size, because <CODE>cardinality</CODE> returns -1 for infinte sets. (All the non-negative integers were taken. Sorry.) Instead, you have to write something like <PRE> { my $a_card = $a->cardinality; my $b_card = $b->cardinality; </PRE> <PRE> $a_card == $b_card and return 0; $a_card < 0 and return 1; $b_card < 0 and return -1; $a_card <=> $b_card }</PRE> <H2><A NAME="grep_set and map_set">grep_set and map_set</A></H2> <CODE>grep_set</CODE> and <CODE>map_set</CODE> make it easy to construct sets for which the internal representation used by <CODE>Set::IntSpan</CODE> is not small. Consider: <PRE> $billion = new Set::IntSpan '0-1_000_000_000'; # OK $odd = grep_set { $_ & 1 } $billion; # trouble $even = map_set { $_ * 2 } $billion; # double trouble</PRE> <H2><A NAME="error handling">Error handling</A></H2> There are two common approaches to error handling: exceptions and return codes. There seems to be some religion on the topic, so <CODE>Set::IntSpan</CODE> provides support for both. To catch exceptions, protect method calls with an eval: <PRE> $run_list = <STDIN>; eval { $set = new Set::IntSpan $run_list }; $@ and print "$@: try again\n";</PRE> To check return codes, use an appropriate method call to validate arguments: <PRE> $run_list = <STDIN>; if (valid Set::IntSpan $run_list) { $set = new Set::IntSpan $run_list } else { print "$@ try again\n" }</PRE> Similarly, use <CODE>finite</CODE> to protect calls to <CODE>elements</CODE>: <PRE> finite $set and @elements = elements $set;</PRE> Calling <CODE>elements</CODE> on a large, finite set can generate an ``Out of memory!'' message, which cannot (easily) be trapped. Applications that must retain control after an error can use <CODE>intersect</CODE> to protect calls to <CODE>elements</CODE>: <PRE> @elements = elements { intersect $set "-1_000_000 - 1_000_000" };</PRE> or check the size of $set first: <PRE> finite $set and cardinality $set < 2_000_000 and @elements = elements $set;</PRE> <H2><A NAME="limitations">Limitations</A></H2> Although <CODE>Set::IntSpan</CODE> 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. <H2><A NAME="roots">Roots</A></H2> The sets implemented here are based on a Macintosh data structure called a region. See Inside Macintosh for more information. <HR> <H1><A NAME="author">AUTHOR</A></H1> Steven McDougall, <A HREF="mailto:swmcd@world.std.com">swmcd@world.std.com</A> <HR> <H1><A NAME="copyright">COPYRIGHT</A></H1> Copyright 1996-1998 by Steven McDougall. This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself. <TABLE BORDER=0 CELLPADDING=0 CELLSPACING=0 WIDTH=100%> <TR><TD CLASS=block VALIGN=MIDDLE WIDTH=100% BGCOLOR="#cccccc"> Set::IntSpan - Manages sets of integers </TD></TR> </TABLE> </BODY> </HTML>